Results 1  10
of
188,069
Grounding in communication
 In
, 1991
"... We give a general analysis of a class of pairs of positive selfadjoint operators A and B for which A + XB has a limit (in strong resolvent sense) as h10 which is an operator A, # A! Recently, Klauder [4] has discussed the following example: Let A be the operator(d2/A2) + x2 on L2(R, dx) and let ..."
Abstract

Cited by 1082 (19 self)
 Add to MetaCart
We give a general analysis of a class of pairs of positive selfadjoint operators A and B for which A + XB has a limit (in strong resolvent sense) as h10 which is an operator A, # A! Recently, Klauder [4] has discussed the following example: Let A be the operator(d2/A2) + x2 on L2(R, dx) and let B = 1 x 1s. The eigenvectors and eigenvalues of A are, of course, well known to be the Hermite functions, H,(x), n = 0, l,... and E, = 2n + 1. Klauder then considers the eigenvectors of A + XB (A> 0) by manipulations with the ordinary differential equation (we consider the domain questions, which Klauder ignores, below). He finds that the eigenvalues E,(X) and eigenvectors &(A) do not converge to 8, and H, but rather AO) + (en 4 Ho+, J%(X)+ gn+1 I n = 0, 2,..., We wish to discuss in detail the general phenomena which Klauder has uncovered. We freely use the techniques of quadratic forms and strong resolvent convergence; see e.g. [3], [5]. Once one decides to analyze Klauder’s phenomenon in the language of quadratic forms, the phenomenon is quite easy to understand and control. In fact, the theory is implicit in Kato’s book [3, VIII.31.
Isolation of a cDNA clone derived from a bloodborne nonA, nonB viral hepatitis genome
, 1989
"... you have obtained prior permission, you may not download an entire issue of a journal or multiple copies of articles, and you may use content in the JSTOR archive only for your personal, noncommercial use. Please contact the publisher regarding any further use of this work. Publisher contact inform ..."
Abstract

Cited by 635 (14 self)
 Add to MetaCart
you have obtained prior permission, you may not download an entire issue of a journal or multiple copies of articles, and you may use content in the JSTOR archive only for your personal, noncommercial use. Please contact the publisher regarding any further use of this work. Publisher contact information may be obtained at
Dynamic Finegrained Localization in AdHoc Networks of Sensors
 PROCEEDINGS OF THE SEVENTH ANNUAL INTERNATIONAL CONFERENCE ON MOBILE COMPUTING AND NETWORKING, MOBICOM 2001
, 2001
"... ..."
Linear pattern matching algorithms
 IN PROCEEDINGS OF THE 14TH ANNUAL IEEE SYMPOSIUM ON SWITCHING AND AUTOMATA THEORY. IEEE
, 1972
"... In 1970, Knuth, Pratt, and Morris [1] showed how to do basic pattern matching in linear time. Related problems, such as those discussed in [4], have previously been solved by efficient but suboptimal algorithms. In this paper, we introduce an interesting data structure called a bitree. A linear ti ..."
Abstract

Cited by 549 (0 self)
 Add to MetaCart
In 1970, Knuth, Pratt, and Morris [1] showed how to do basic pattern matching in linear time. Related problems, such as those discussed in [4], have previously been solved by efficient but suboptimal algorithms. In this paper, we introduce an interesting data structure called a bitree. A linear time algorithm for obtaining a compacted version of a bitree associated with a given string is presented. With this construction as the basic tool, we indicate how to solve several pattern matching problems, including some from [4], in linear time.
Wireless Communications
, 2005
"... Copyright c ○ 2005 by Cambridge University Press. This material is in copyright. Subject to statutory exception and to the provisions of relevant collective licensing agreements, no reproduction of any part may take place without the written permission of Cambridge University ..."
Abstract

Cited by 1129 (32 self)
 Add to MetaCart
Copyright c ○ 2005 by Cambridge University Press. This material is in copyright. Subject to statutory exception and to the provisions of relevant collective licensing agreements, no reproduction of any part may take place without the written permission of Cambridge University
Accurate whole human genome sequencing using reversible terminator chemistry. Nature 456: 53–59
, 2008
"... ..."
A MetaAnalytic Review of Experiments Examining the Effects of Extrinsic Rewards on Intrinsic Motivation
"... A metaanalysis of 128 studies examined the effects of extrinsic rewards on intrinsic motivation. As predicted, engagementcontingent, completioncontingent, and performancecontingent rewards significantly undermined freechoice intrinsic motivation (d =0.40,0.36, and0.28, respectively), as did ..."
Abstract

Cited by 602 (16 self)
 Add to MetaCart
A metaanalysis of 128 studies examined the effects of extrinsic rewards on intrinsic motivation. As predicted, engagementcontingent, completioncontingent, and performancecontingent rewards significantly undermined freechoice intrinsic motivation (d =0.40,0.36, and0.28, respectively), as did all rewards, all tangible rewards, and all expected rewards. Engagementcontingent and completioncontingent rewards also significantly undermined selfreported interest (d =0.15, and —0.17), as did all tangible rewards and all expected rewards. Positive feedback enhanced both freechoice behavior (d = 0.33) and selfreported interest (d = 0.31). Tangible rewards tended to be more detrimental for children than college students, and verbal rewards tended to be less enhancing for children than college students. The authors review 4 previous metaanalyses of this literature and detail how this study's methods, analyses, and results differed from the previous ones. By 1971, hundreds of studies within the operant tradition (Skinner, 1953) had established that extrinsic rewards can control behavior. When administered closely subsequent to a behavior, rewards were reliably found to increase the likelihood that the behavior would be emitted again, an effect that persisted as long as
Additive Logistic Regression: a Statistical View of Boosting
 Annals of Statistics
, 1998
"... Boosting (Freund & Schapire 1996, Schapire & Singer 1998) is one of the most important recent developments in classification methodology. The performance of many classification algorithms can often be dramatically improved by sequentially applying them to reweighted versions of the input dat ..."
Abstract

Cited by 1719 (25 self)
 Add to MetaCart
Boosting (Freund & Schapire 1996, Schapire & Singer 1998) is one of the most important recent developments in classification methodology. The performance of many classification algorithms can often be dramatically improved by sequentially applying them to reweighted versions of the input data, and taking a weighted majority vote of the sequence of classifiers thereby produced. We show that this seemingly mysterious phenomenon can be understood in terms of well known statistical principles, namely additive modeling and maximum likelihood. For the twoclass problem, boosting can be viewed as an approximation to additive modeling on the logistic scale using maximum Bernoulli likelihood as a criterion. We develop more direct approximations and show that they exhibit nearly identical results to boosting. Direct multiclass generalizations based on multinomial likelihood are derived that exhibit performance comparable to other recently proposed multiclass generalizations of boosting in most...
Parameterized Complexity
, 1998
"... the rapidly developing systematic connections between FPT and useful heuristic algorithms  a new and exciting bridge between the theory of computing and computing in practice. The organizers of the seminar strongly believe that knowledge of parameterized complexity techniques and results belongs ..."
Abstract

Cited by 1218 (75 self)
 Add to MetaCart
the rapidly developing systematic connections between FPT and useful heuristic algorithms  a new and exciting bridge between the theory of computing and computing in practice. The organizers of the seminar strongly believe that knowledge of parameterized complexity techniques and results belongs into the toolkit of every algorithm designer. The purpose of the seminar was to bring together leading experts from all over the world, and from the diverse areas of computer science that have been attracted to this new framework. The seminar was intended as the rst larger international meeting with a specic focus on parameterized complexity, and it hopefully serves as a driving force in the development of the eld. 1 We had 49 participants from Australia, Canada, India, Israel, New Zealand, USA, and various European countries. During the workshop 25 lectures were given. Moreover, one night session was devoted to open problems and Thursday was basically used for problem discussion
Data Integration: A Theoretical Perspective
 Symposium on Principles of Database Systems
, 2002
"... Data integration is the problem of combining data residing at different sources, and providing the user with a unified view of these data. The problem of designing data integration systems is important in current real world applications, and is characterized by a number of issues that are interestin ..."
Abstract

Cited by 944 (45 self)
 Add to MetaCart
Data integration is the problem of combining data residing at different sources, and providing the user with a unified view of these data. The problem of designing data integration systems is important in current real world applications, and is characterized by a number of issues that are interesting from a theoretical point of view. This document presents on overview of the material to be presented in a tutorial on data integration. The tutorial is focused on some of the theoretical issues that are relevant for data integration. Special attention will be devoted to the following aspects: modeling a data integration application, processing queries in data integration, dealing with inconsistent data sources, and reasoning on queries.
Results 1  10
of
188,069