Results 1  10
of
48
LEARNING BINARY RELATIONS AND TOTAL ORDERS
, 1993
"... The problem of learning a binary relation between two sets of objects or between a set and itself is studied. This paper represents a binary relation between a set of size n and a set of size rn as an n rn matrix of bits whose (i, j) entry is if and only if the relation holds between the correspond ..."
Abstract

Cited by 36 (5 self)
 Add to MetaCart
The problem of learning a binary relation between two sets of objects or between a set and itself is studied. This paper represents a binary relation between a set of size n and a set of size rn as an n rn matrix of bits whose (i, j) entry is if and only if the relation holds between the corresponding elements of the two sets. Polynomial prediction algorithms are presented for learning binary relations in an extended online learning model, where the examples are drawn by the learner, by a helpful teacher, by an adversary, or according to a uniform probability distribution on the instance space. The first part of this paper presents results for the case in which the matrix of the relation has at most k row types. It presents upper and lower bounds on the number of prediction mistakes any prediction algorithm makes when learning such a matrix under the extended online learning model. Furthermore, it describes a technique that simplifies the proof of expected mistake bounds against a randomly chosen query sequence. In the second part of this paper the problem of learning a binary relation that is a total order on a set is considered. A general technique using a fully polynomial randomized approximation scheme (fpras) to implement a randomized version of the halving algorithm is described. This technique is applied to the problem of learning a total order, through the use of an fpras for counting the number of extensions of a partial order, to obtain a polynomial prediction algorithm that with high probability makes at most n lg n + (lg e)lg n mistakes when an adversary selects the query sequence. The case in which a teacher or the learner selects the query sequence is also considered
Supporting ComponentBased Software Development with Active Component Repository Systems
, 2001
"... ..."
(Show Context)
Improved dynamic rankselect entropybound structures
 in Proc. of the Latin American Theoretical Informatics (LATIN
"... Abstract. Operations rank and select over a sequence of symbols have many applications to the design of succinct and compressed data structures to manage text collections, structured text, binary relations, trees, graphs, and so on. We are interested in the case where the collections can be updated ..."
Abstract

Cited by 18 (4 self)
 Add to MetaCart
Abstract. Operations rank and select over a sequence of symbols have many applications to the design of succinct and compressed data structures to manage text collections, structured text, binary relations, trees, graphs, and so on. We are interested in the case where the collections can be updated via insertions and deletions of symbols. Two current solutions stand out as the best in the tradeoff of space versus time (considering all the operations). One by Mäkinen and Navarro achieves compressed space (i.e., nH0 + o(n log σ) bits) and O(log nlog σ) worstcase time for all the operations, where n is the sequence length, σ is the alphabet size, and H0 is the zeroorder entropy of the sequence. The other log σ log log n solution, by Lee and Park, achieves O(log n(1 +)) amortized time and uncompressed space, i.e. nlog σ +O(n)+o(nlog σ) bits. In this paper we show that the best of both worlds can be achieved. We log σ combine the solutions to obtain nH0+o(nlog σ) bits of space and O(log n(1+)) worstcase time log log n for all the operations. Apart from the best current solution, we obtain some byproducts that might be
Constrained Coding for Binary Channels with High Intersymbol Interference
 IEEE TRANS. INFORM. THEORY
, 1999
"... Partialresponse (PR) signalling is used to model communications channels with intersymbol interference (ISI) such as the magnetic recording channel and the copper wire channel for digital subscriber lines. Coding for improving noise immunity in higherorder partial response channels, such as the &q ..."
Abstract

Cited by 16 (8 self)
 Add to MetaCart
(Show Context)
Partialresponse (PR) signalling is used to model communications channels with intersymbol interference (ISI) such as the magnetic recording channel and the copper wire channel for digital subscriber lines. Coding for improving noise immunity in higherorder partial response channels, such as the "extended" class4 channels denoted EPR4, E 2 PR4, E 3 PR4, has become an important subject as the linear densities in magnetic recording approach those at which these partialresponse channels are the best models of real channels. In this paper, we consider partialresponse channels for which ISI is so severe that the channels fail to achieve the matchedfilterbound (MFB) for symbol error rate, assuming maximum likelihood decoding. We show that their performance can be improved to the MFB by high rate codes based on constrained systems, some of which may even simplify the Viterbi detectors relative to the uncoded channels. We present several examples of highrate constrained codes for E ...
Multiparty Secret Key Exchange Using a Random Deal of Cards (Extended Abstract)
 In Proc. CRYPTO
, 1992
"... ) Michael J. Fischer Rebecca N. Wright Computer Science Department Computer Science Department Yale University Yale University New Haven, CT 065202158 New Haven, CT 065202158 fischermichael@cs.yale.edu wrightrebecca@cs.yale.edu Abstract We consider the problem of multiparty secret key e ..."
Abstract

Cited by 14 (4 self)
 Add to MetaCart
(Show Context)
) Michael J. Fischer Rebecca N. Wright Computer Science Department Computer Science Department Yale University Yale University New Haven, CT 065202158 New Haven, CT 065202158 fischermichael@cs.yale.edu wrightrebecca@cs.yale.edu Abstract We consider the problem of multiparty secret key exchange. A "team" of players P1 through Pk wishes to determine an nbit secret key in the presence of a computationally unlimited eavesdropper, Eve. The team players are dealt hands of cards of prespecified sizes from a deck of d distinct cards; any remaining cards are dealt to Eve. We explore how the team can use the information contained in their hands of cards to determine an nbit key that is secret from Eve, that is, an n bit string which each team player knows exactly but for which Eve's probability of guessing the key correctly is 1=2 n both before and after she hears the communication between the team players. We describe randomized protocols for secret key exchange that w...
Designing SocioTechnical Environments in Support of MetaDesign and Social Creativity
"... Abstract: This paper provides elements of a transformational conceptual framework for CSCL by focusing on how learning takes place when the answer is not known (this being the case for complex design problems in numerous domains encountered in lifelong learning activities). The paper postulates, exp ..."
Abstract

Cited by 10 (3 self)
 Add to MetaCart
(Show Context)
Abstract: This paper provides elements of a transformational conceptual framework for CSCL by focusing on how learning takes place when the answer is not known (this being the case for complex design problems in numerous domains encountered in lifelong learning activities). The paper postulates, explores, and discusses visions, theories, systems, practices, and methods for CSCL with a focus on reflective communities (bringing stakeholders together from many different backgrounds, requiring cultural and epistemological pluralism to make all voices heard), metadesign (allowing owners of problems to act as designers and active contributors, and not only as consumers), and social creativity (bringing different and often controversial points of view together to create a shared understanding among stakeholders that can lead to new insights, new ideas, and new artifacts). Innovative sociotechnical environments are needed to make progress in achieving these objectives. Examples and characteristics of such environments will be briefly presented and discussed. Some implications and challenges for future research in CSCL are derived and articulated.
Examining Software Design from a General Design Perspective
, 2006
"... Our community’s understanding of software design has certainly improved over the years, as have our approaches and our ability to design highquality software. But compared to other design disciplines, the software design field is unable to objectively answer some fundamental questions about where i ..."
Abstract

Cited by 5 (4 self)
 Add to MetaCart
(Show Context)
Our community’s understanding of software design has certainly improved over the years, as have our approaches and our ability to design highquality software. But compared to other design disciplines, the software design field is unable to objectively answer some fundamental questions about where it stands. Through a new, interdisciplinary framework, we place software design in a general design perspective, examine existing conceptual points of view and technical contributions, and suggest promising research directions. In so doing, we learn that we can and must treat software design as an inherent design discipline, that the field’s successes to date have been in line with such a view, and that the framework can serve as a basis for engaging in the discussion necessary to answer the questions that have remained elusive to date. 1.
Simulation of Proposed OnLine Third Order Resonance Correction Schemes
, 2006
"... Simulation of proposed online third order resonance correction schemes ..."
Abstract

Cited by 3 (3 self)
 Add to MetaCart
(Show Context)
Simulation of proposed online third order resonance correction schemes