1,720,961 research outputs found
Perfectly-Secure Dynamic-Conference Key Distribution
No full textAbstract. A conference key (key) distribution scheme is a method to distribute some pieces of information among a set of users is such a way each group (pair) of users can compute a common key to use for secure communication. In this paper we analyze conference key and key distribution scheme(s) in which the off-line server, once distributed pieces of information to users, is no more needed to set up common keys, the group is then determined dynamically. We use an information-theoretic framework, and thus the security does not rely on the assumption that solving specific computational problems is difficult. We first consider a non-interactive model: A server distributes some pieces of information to users in such a way that any group of t of them can compute a common key without any interaction, that is each user can compute the common key on input his piece of information and the identities of the other t \Gamma 1 users. Keys are secure against coalitions of up to k users, that is ev..
Protecting People Location Information
No full textUrs Hengartner and Peter Steenkiste ### # Department of Computer Science Department of Electrical and Computer Engineering Carnegie Mellon University uhengart,prs # @cs.cmu.edu
: A Butterfly-topology Parallel GA as A Function Optimizer
No full textFattaneh Taghiyareh and Hiroshi Nagahashi Interdisciplinary Graduate School of Science and Engineering Tokyo Institute of Technology Genetic algorithms (GAs) are receiving increased attention in difficult search and optimization applications, however in solving larger and more difficult search problems, adequate solutions may not be found in an expected range of time. Consequently multiple efforts have been conducted to make GAs faster and implementing them in parallel is one of the most promising choices [4]. Parallel GAs may be categorized as follows : micro-grain parallel GAs, fine-grain parallel GAs, and coarse-grain parallel GAs. Fine-grain parallel GAs which are subject of this work, partition the population into a large number of very small subpopulations. The ideal case is to have just one individual for every processing element available as its subpopulation. This model is suited for massively parallel computers, however, it can be implemented on any other multiprocessor as we..
A Logic for Encapsulation in Object Oriented Languages
No full text) Michele Bugliesi 1 Dip. di Matematica Pura ed Applicata, Univ. di Padova Via Belzoni 7, I-35131 Padova, Italy e-mail: [email protected] Hasan M. Jamil 2 Department of Computer Science, Concordia University Montr'eal, Qu'ebec, Canada H3G 1M8 e-mail: [email protected] Abstract. We present a logic language with encapsulation based on an object-oriented data model. We give a formal account of the semantics of this language by defining a proof theory, a model theory and a fixed point theory. We also show that the different characterizations of the semantics are equivalent. We then study the logical foundations of encapsulation by introducing a mapping from our language to a corresponding modal language, and we show that the proof theory of the language is sound and complete with respect to the entailment relation of the corresponding modal framework. The proposed semantics represents -- to our knowledge -- the first attempt to capture a truly logical sem..
Going Beyond Counting First Authors in Author Co-citation Analysis
Full text linkThe present study examines one of the fundamental aspects of author co-citation analysis (ACA) - the way co-citation
counts are defined. Co-citation counting provides the data on which all subsequent statistical analyses and mappings
are based, and we compare ACA results based on two different types of co-citation counting - the traditional type that
only counts the first one among a cited work's authors on the one hand and a non-traditional type that takes into
account the first 5 authors of a cited work on the other hand. Results indicate that the picture produced through this non-traditional author co-citation counting contains more coherent author groups and is therefore considerably clearer. However, this picture represents fewer specialties in the research field being studied than that produced through the traditional first-author co-citation counting when the same number of top-ranked authors is selected and analyzed. Reasons for these effects are discussed
Fast, Long-Lived Renaming
No full text) Mark Moir and James H. Anderson Department of Computer Science The University of North Carolina at Chapel Hill Chapel Hill, North Carolina 27599-3175, USA April 1994 Abstract We consider wait-free solutions to the renaming problem for shared-memory multiprocessing systems [3, 5]. In the renaming problem, processes are required to choose new names in order to reduce the size of their name space. Previous solutions to the renaming problem have time complexity that is dependent on the size of the original name space, and allow processes to acquire names only once. In this paper, we present several new renaming algorithms. Most of our algorithms have time complexity that is independent of the size of the original name space, and some of our algorithms solve a new, more general version of the renaming problem called long-lived renaming. In long-lived renaming algorithms, processes may repeatedly acquire and release names. Keywords: fast renaming, long-lived renaming, shared..
Towards Highly Available Three-Tier Monitoring Applications
No full textDavid Breitgand, Gleb Shaviner, and Danny Dolev School of Computer Science and Engineering, The Hebrew University of Jerusalem, Givat-Ram 91904, Jerusalem E-Mail: {davb, gleb, dolev}@cs.huji.ac.il Abstract. Numerous important network management applications such as usage-based accounting, trend analysis, performance management, fault management, and others perform application-specific network monitoring tasks as part of their activities. This paper presents a work in progress that is aimed at providing a maximally transparent infrastructure increasing the availability of such management applications by improving the failure behavior of their constituent monitoring components
Variations on the Author
Full text link“Variations on the Author” discusses two of Eduardo Coutinho’s recent films (Um Dia na Vida, from 2010, and Últimas Conversas, posthumously released in 2015) and their contribution to the general question of documentary authorship. The director’s filmography is characterized by a consistent yet self-effacing form of authorial self-inscription: Coutinho often features as an interviewer that rather than express opinions propels discourses; an interviewer that is good at listening. This mode of self-inscription characterizes him as an author who is not expressive but who is nonetheless markedly present on the screen. In Um Dia na Vida, however, Coutinho is completely absent form the image, while Últimas Conversas, on the contrary, includes a confessional prologue that moves the director from the margins to the center of his films. This article examines the ways in which these works stand out in the filmography of a director who offers new insights into the notion of cinematic authorship
Appropriate Similarity Measures for Author Cocitation Analysis
Full text linkWe provide a number of new insights into the methodological discussion about author cocitation analysis. We first argue that the use of the Pearson correlation for measuring the similarity between authors’ cocitation profiles is not very satisfactory. We then discuss what kind of similarity measures may be used as an alternative to the Pearson correlation. We consider three similarity measures in particular. One is the well-known cosine. The other two similarity measures have not been used before in the bibliometric literature. Finally, we show by means of an example that our findings have a high practical relevance.information science;Pearson correlation;cosine;similarity measure;author cocitation analysis
- …
