Your use of the JSTOR archive indicates your acceptance of JSTOR's Terms and Conditions of Use, available at

The Internet presents numerous sources of useful information---telephone directories, product catalogs, stock quotes, weather forecasts, etc. Recently, many systems have been built that automatically gather and manipulate such information on a user's behalf. However, these resources are usually formatted for use by people (e.g., the relevant content is embedded in HTML pages), so extracting their content is difficult. Wrappers are often used for this purpose. A wrapper is a procedure for extracting a particular resource's content. Unfortunately, hand-coding wrappers is tedious. We introduce wrapper induction, a technique for automatically constructing wrappers. Our techniques can be described in terms of three main contributions. First, we pose the problem of wrapper construction as one of inductive learn...

We propose a theory of securities market under- and overreactions based on two well-known psychological biases: investor overconfidence about the precision of private information; and biased self-attribution, which causes asymmetric shifts in investors ’ confidence as a function of their investment outcomes. We show that overconfidence implies negative long-lag autocorrelations, excess volatility, and, when managerial actions are correlated with stock mispricing, public-event-based return predictability. Biased self-attribution adds positive short-lag autocorrela-tions ~“momentum”!, short-run earnings “drift, ” but negative correlation between future returns and long-term past stock market and accounting performance. The theory also offers several untested implications and implications for corporate fi-nancial policy. IN RECENT YEARS A BODY OF evidence on security returns has presented a sharp challenge to the traditional view that securities are rationally priced to re-f lect all publicly available information. Some of the more pervasive anoma-

Non-negative matrix factorization (NMF) has previously been shown to be a useful decomposition for multivariate data. Two different multiplicative algorithms for NMF are analyzed. They differ only slightly in the multiplicative factor used in the update rules. One algorithm can be shown to minimize the conventional least squares error while the other minimizes the generalized Kullback-Leibler divergence. The monotonic convergence of both algorithms can be proven using an auxiliary function analogous to that used for proving convergence of the ExpectationMaximization algorithm. The algorithms can also be interpreted as diagonally rescaled gradient descent, where the rescaling factor is optimally chosen to ensure convergence.

Suppose one is given a description of a system, together with an observation of the system's behaviour which conflicts with the way the system is meant to behave. The diagnostic problem is to determine those components of the system which, when assumed to be functioning abnormally, will explain the discrepancy between the observed and correct system behaviour. We propose a general theory for this problem. The theory requires only that the system be described in a suitable logic. Moreover, there are many such suitable logics, e.g. first-order, temporal, dynamic, etc. As a result, the theory accommodates diagnostic reasoning in a wide variety of practical settings, including digital and analogue circuits, medicine, and database updates. The theory leads to an algorithm for computing all diagnoses, and to various results concerning principles of measurement for discriminating among competing diagnoses. Finally, the theory reveals close connections between diagnostic reasoning and nonmonotonic reasoning.

Abstract not found

and sheltered subject matter teaching (Krashen, 2003), the inefficacy of error correction (Truscott, 1996, 1999), and the "power of reading " (Krashen, 2004). Subsequent research has also, in my opinion, confirmed that in footnote 5, chapter 3, option 3 is the correct one, that we acquire vocabulary

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, non-commercial use. Please contact the publisher regarding any further use of this work. Publisher contact information may be obtained at

have been devised to survey gene functions en masse either computationally (Marcotte et al., 1999) or experimentally; among these, highly parallel assays of

Abstract not found