Results 1 - 10 of 5,431

Relating two standard notions of secrecy

by Véronique Cortier, Michaël Rusinowitch, Eugen Zălinescu , 2006
"... Two styles of definitions are usually considered to express that a security protocol preserves the confidentiality of a data s. Reachability-based secrecy means that s should never be disclosed while equivalence-based secrecy states that two executions of a protocol with distinct instances for s sho ..."
Abstract - Cited by 19 (0 self) - Add to MetaCart
for s should be indistinguishable to an attacker. Although the second formulation ensures a higher level of security and is closer to cryptographic notions of secrecy, decidability results and automatic tools have mainly focused on the first definition so far. This paper initiates a systematic investigation

Relating two standard notions of secrecy

by Eugen Zălinescu, Véronique Cortier, Michaël Rusinowitch , 2006
"... Two styles of definitions are usually considered to express that a security protocol preserves the confidentiality of a data s. Reachability-based secrecy means that s should never be disclosed while equivalence-based secrecy states that two executions of a protocol with distinct instances for s sh ..."
Abstract - Add to MetaCart
for s should be indistinguishable to an attacker. Although the second formulation ensures a higher level of security and is closer to cryptographic notions of secrecy, decidability results and automatic tools have mainly focused on the first definition so far. This paper initiates a systematic investigation

Relating two standard notions of secrecy?

by unknown authors
"... Abstract. Two styles of definitions are usually considered to express that a security protocol preserves the confidentiality of a data s. Reachability-based secrecy means that s should never be disclosed while equivalence-based secrecy states that two executions of a protocol with distinct instances ..."
Abstract - Add to MetaCart
instances for s should be indistinguishable to an attacker. Al-though the second formulation ensures a higher level of security and is closer to cryptographic notions of secrecy, decidability results and auto-matic tools have mainly focused on the first definition so far. This paper initiates a systematic

Word Association Norms, Mutual Information, and Lexicography

by Kenneth Ward Church, Patrick Hanks , 1990
"... This paper will propose an objective measure based on the information theoretic notion of mutual information, for estimating word association norms from computer readable corpora. (The standard method of obtaining word association norms, testing a few thousand subjects on a few hundred words, is b ..."
Abstract - Cited by 1144 (11 self) - Add to MetaCart
This paper will propose an objective measure based on the information theoretic notion of mutual information, for estimating word association norms from computer readable corpora. (The standard method of obtaining word association norms, testing a few thousand subjects on a few hundred words

A SOUND TYPE SYSTEM FOR SECURE FLOW ANALYSIS

by Dennis Volpano, Geoffrey Smith, Cynthia Irvine , 1996
"... Ensuring secure information ow within programs in the context of multiple sensitivity levels has been widely studied. Especially noteworthy is Denning's work in secure ow analysis and the lattice model [6][7]. Until now, however, the soundness of Denning's analysis has not been established ..."
Abstract - Cited by 540 (21 self) - Add to MetaCart
established satisfactorily. Weformulate Denning's approach as a type system and present a notion of soundness for the system that can be viewed as a form of noninterference. Soundness is established by proving, with respect to a standard programming language semantics, that all well-typed programs have

Algorithmic mechanism design

by Noam Nisan, Amir Ronen - Games and Economic Behavior , 1999
"... We consider algorithmic problems in a distributed setting where the participants cannot be assumed to follow the algorithm but rather their own self-interest. As such participants, termed agents, are capable of manipulating the algorithm, the algorithm designer should ensure in advance that the agen ..."
Abstract - Cited by 662 (23 self) - Add to MetaCart
that the agents ’ interests are best served by behaving correctly. Following notions from the field of mechanism design, we suggest a framework for studying such algorithms. Our main technical contribution concerns the study of a representative task scheduling problem for which the standard mechanism design tools

Non-negative matrix factorization with sparseness constraints,”

by Patrik O Hoyer , Patrik Hoyer@helsinki , Fi - Journal of Machine Learning Research, , 2004
"... Abstract Non-negative matrix factorization (NMF) is a recently developed technique for finding parts-based, linear representations of non-negative data. Although it has successfully been applied in several applications, it does not always result in parts-based representations. In this paper, we sho ..."
Abstract - Cited by 498 (0 self) - Add to MetaCart
show how explicitly incorporating the notion of 'sparseness' improves the found decompositions. Additionally, we provide complete MATLAB code both for standard NMF and for our extension. Our hope is that this will further the application of these methods to solving novel data

Determinants of Economic Growth: A Cross-Country Empirical Study

by Robert J. Barro , 1996
"... Empirical findings for a panel of around 100 countries from 1960 to 1990 strongly support the general notion of conditional convergence. For a given starting level of real per capita GDP, the growth rate is enhanced by higher initial schooling and life expectancy, lower fertility, lower government c ..."
Abstract - Cited by 892 (12 self) - Add to MetaCart
Empirical findings for a panel of around 100 countries from 1960 to 1990 strongly support the general notion of conditional convergence. For a given starting level of real per capita GDP, the growth rate is enhanced by higher initial schooling and life expectancy, lower fertility, lower government

SIGNAL RECOVERY BY PROXIMAL FORWARD-BACKWARD SPLITTING

by Patrick L. Combettes, Valérie R. Wajs - MULTISCALE MODEL. SIMUL. TO APPEAR
"... We show that various inverse problems in signal recovery can be formulated as the generic problem of minimizing the sum of two convex functions with certain regularity properties. This formulation makes it possible to derive existence, uniqueness, characterization, and stability results in a unifi ..."
Abstract - Cited by 509 (24 self) - Add to MetaCart
unified and standardized fashion for a large class of apparently disparate problems. Recent results on monotone operator splitting methods are applied to establish the convergence of a forward-backward algorithm to solve the generic problem. In turn, we recover, extend, and provide a simplified analysis

Intelligence Without Representation

by Rodney Brooks - Artificial Intelligence , 1991
"... Artificial intelligence research has foundered on the issue of representation. When intelligence is approached in an incremental manner, with strict reliance on interfacing to the real world through perception and action, reliance on representation disappears. In this paper we outline our approach t ..."
Abstract - Cited by 1798 (13 self) - Add to MetaCart
producers which all interface directly to the world through perception and action, rather than interface to each other particularly much. The notions of central and peripheral systems evaporateeverything is both central and peripheral. Based on these principles we have built a very successful series
Results 1 - 10 of 5,431