A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2006; you can also visit the original URL.
The file type is application/pdf
.
Filters
The DirSA case study: An introduction to software architecture technology
2002
Bell Labs technical journal
The technical contributions of Saswata Bhattacharya, Piyush Lumba, Rahim Choudhary, and Ninad Mehta, also of Lucent, were valuable in specifying the directory architecture. ...
Acknowledgments We gratefully acknowledge Don Stewart and David Sokoler of Lucent Technologies, who lent their confident leadership and support to the directory architecture engineering and specification ...
It can be implemented as a configuration of possibly distributed data servers, DirSOFT, compliant with the DSA specification of the ISO X.500 standard. ...
doi:10.1002/bltj.2120
fatcat:zdcrylhkqjbzdccfug7su6fdh4
Building a peer-to-peer content distribution network with high performance, scalability and robustness
2011
Information Systems
Content Distribution Networks (CDN) are fundamental, yet expensive technologies for distributing the content of web-servers to large audiences. ...
A cost analysis that focuses on the gossip overhead of our approach is given in Section 5. Simulation methodology and results are presented in Section 6. ...
The DHT-Directory strategy stores at the peer identified by the hash of the object's URL a small directory of pointers to recent downloaders of the object. ...
doi:10.1016/j.is.2010.08.007
fatcat:wyct5agxwfcezl4edzcj4push4
Failure-Tolerant Transaction Routing at Large Scale
2010
2010 Second International Conference on Advances in Databases, Knowledge, and Data Applications
In this article, we propose a failure-tolerant solution for the distributed control of transaction routing in a large scale network. ...
In particular, centralized control is prohibited because of its vulnerability and lack of efficiency at large scale. ...
Shared Directory nodes (SD) are the building blocks of the shared directory implemented as a distributed index. ...
doi:10.1109/dbkda.2010.9
dblp:conf/dbkda/SarrNG10
fatcat:fc2ht7ixl5ch3hnsgbdvf6bqzq
An LDAP-based User Modeling Server and its Evaluation
2006
User modeling and user-adapted interaction
Directories also allow for the virtual centralization of distributed user models and their selective centralized replication if better performance is needed. ...
, dynamic and transparent management of distributed information, built-in replication and synchronization, a rich number of pre-defined types of user information, and extensibility of the core representation ...
We would like to thank the anonymous reviewers for their valuable comments on an earlier version of this paper. ...
doi:10.1007/s11257-006-9006-5
fatcat:l2smehqbrvdszp66flwaulnrzq
Privacy-Preserving DNS: Analysis of Broadcast, Range Queries and Mix-Based Protection Methods
[chapter]
2011
Lecture Notes in Computer Science
The design consists of two building blocks: a broadcast scheme for the distribution of a "top list" of DNS hostnames, and low-latency Mixes for requesting the remaining hostnames unobservably. ...
We show that broadcasting the 10,000 most frequently queried hostnames allows zero-latency lookups for over 80 % of DNS queries at reasonable cost. ...
the hypergeometric distribution: P n T = P (X > 0) = 1 − P (X = 0) = 1 − αN 0 (1−α)N n N n = 1 − (1−α)N n N n For T = 200ms we obtained α = 7 %, i. e., P 10 200ms ≈ 0.516 and P 100 200ms ≈ 0.999, which ...
doi:10.1007/978-3-642-23822-2_36
fatcat:4qeel4zemvcphn3plh6r2rjwye
Probabilistic Dropping in Push and Pull Dissemination over Distributed Hash Tables
2011
2011 IEEE 11th International Conference on Computer and Information Technology
We exploit the concept of popularity of specific items, which is evaluated by performing a real-time analysis of the query distribution, and allows to decrease a significant fraction of messages without ...
Dynamic information management via Distributed Hash Tables (DHT) is an important problem which revolves around the trade-off between data freshness and the overhead due to information updates. ...
Acknowledgments The authors acknowledge the support of Project FP7-257438, Contrail: Open Computing Infrastructures for Elastic Services and Project FP6-033576 XtreemOS: Building and Promoting a Linuxbased ...
doi:10.1109/cit.2011.94
dblp:conf/IEEEcit/CarliniCR11
fatcat:wfk5pgtxxffpvcvzcwqsaapr4i
Face Recognition Of Profile Image Stored On Blob
2018
Zenodo
Face acknowledgment is a combination of face detection and face recognition. ...
For recognized person look in biometric framework a few strategies are accessible, for example, thumb impression, signature identification, eye to eye connection, design coordinating, picture approval ...
Selection one parameter and separation into organizes x-y axis . ...
doi:10.5281/zenodo.1226630
fatcat:vbvivoksjbb7joe5ck36ky4hfu
Understanding the Roles of Servers in Large-Scale Peer-Assisted Online Storage Systems
2009
2009 IEEE International Conference on Communications
current design and strategy, which further draw practical implications on future design. ...
Online storage systems that provide versatile and convenient platforms for content distribution have attracted significant attention over the Internet. ...
Server Strategies Servers in FS2You not only provide online storage, but also cooperate with content distribution. Several strategies are adopted to facilitate content replication and distribution. ...
doi:10.1109/icc.2009.5199550
dblp:conf/icc/LiuSLZ09
fatcat:gd42gfwihbgebhbuentr3nztcu
Public Key Infrastructure
[chapter]
2009
Computer and Information Security Handbook
The ability to create, manipulate, and share digital documents has created a host of new applications (email, word processing, e-commerce websites), but also created a new set of problems, namely how to ...
protect the privacy and integrity of digital documents when stored and transmitted. ...
of the broader X.500 directory standard. ...
doi:10.1016/b978-0-12-374354-1.00026-1
fatcat:zbdhgcy5azgnhn453c5kydhuba
A Bayesian cluster analysis method for single-molecule localization microscopy data
2016
Nature Protocols
Three features of such data cause standard cluster analysis approaches to be ineffective: the data take the form of a list of points rather than a pixel array; there is a non-negligible unclustered background ...
We present the process of generating simulated and experimental data which are suitable for our algorithm, the analysis itself, and the extraction and interpretation of key cluster descriptors such as ...
refresh=true) with version no earlier than 2014b.
Procedure 1. In order to start analysis of an experimental dataset, proceed with option A. ...
doi:10.1038/nprot.2016.149
pmid:27854362
fatcat:rxh4bjb5onewxm2gf3dhemnesq
Experiences With the OSF Distributed Computing Environment
[chapter]
1995
Open Distributed Processing
This paper describes the Open Software Foundation's Distributed Computing Environment (OSF DCE) in the context of the ISO Reference Model of Open Distributed Processing (RM-ODP). ...
space browser/editor for the DCE directory service. ...
Thanks also to the pioneering members of the original"Exploitation ofDCE" prototype team, and especially to the team that made HP's DCE into a viable distributed computing platform. ...
doi:10.1007/978-0-387-34882-7_36
fatcat:xja5ldhus5dbbdmdjyy5dpetia
Confidentiality, Integrity and High Availability with Open Source IT green
[article]
2008
arXiv
pre-print
This paper presents elements that form the structure of a network of data using secure stable and mature technologies that meet the requirement of having code free. ...
Basearemos this work experience gained in a real environment and using paravirtualization to show a situation more critical and now real in most companies, the virtualization of servers. ...
We will be using this distribution by the stable version available on the date of creation of this article. ...
arXiv:0805.4394v1
fatcat:gwidww5euve5nf6h2yqtmtrtqm
A churn-resistant peer-to-peer web caching system
2003
Proceedings of the 2003 ACM workshop on Survivable and self-regenerative systems in association with 10th ACM Conference on Computer and Communications Security - SSRS '03
Churn arises from continued and rapid arrival and failure (or departure) of a large number of participants in the system, and traces from deployments have shown that it can lead to extremely stressful ...
In addition, the system improves on the network locality of cache accesses in previous web caching schemes. ...
More specifically, in a system of 1000 nodes, 500 nodes were churned by mapping to the first 500 entries in the Overnet availability traces 4 . ...
doi:10.1145/1036921.1036922
fatcat:f5lmtruorfbspj4tt2s7uremhi
Comparing the Cost of Protecting Selected Lightweight Block Ciphers against Differential Power Analysis in Low-Cost FPGAs
2018
Computers
of architecture targeted to optimize throughput-to-area (TP/A) ratio and suitable for introducing countermeasures to Differential Power Analysis (DPA). ...
difficult, since researchers typically use varied architectures, optimization strategies, technologies, and evaluation techniques. ...
Conflicts of Interest: The authors declare no conflict of interest. ...
doi:10.3390/computers7020028
fatcat:zdm7bm5pwvc6lotedvaldjrwby
RTSYS: A DOS application for the analysis of reaction time data
1996
Behavoir research methods, instruments & computers
RTSYS is a menu-driven DOS application for the manipulation, analysis, and graphical display of reaction time data. ...
Distribution fitting and flexible censoring and rescaling options allow RTSYS to address the problems of reaction time distribution skew and outlying responses with reasonable sample sizes. ...
(i.e., area) of the pdffrom 499 to 500 msec. ...
doi:10.3758/bf03200523
fatcat:btnui44thrfupfdajgefucafri
« Previous
Showing results 1 — 15 out of 1,402 results