Theory and practice of teaching : or, The motives and methods of good school-keeping /

Mode of access: Internet.

Record of achievements and plans of the Information Engineering Laboratory in the Department of Computer Science of the University of Illinois at Urbana-Champaign, 1955-1973

Mode of access: Internet.

The theory and implementation of SRT division /

Issued also as thesis (M.S.) University of Illinois.

Bibliography of technical reports in the fields of computer science and computer engineering issued at the University of Waterloo from 1967 to 1987 /

Includes indexes.

Theory and practice of teaching; or, The motives and methods of good school-keeping,

Mode of access: Internet.

Theory and practice of teaching, or, The motives and methods of good school-keeping ... /

Mode of access: Internet.

Theory and practice of teaching, or, The motives and methods of good school-keeping /

Mode of access: Internet.

Measures to address the impact of computer technology on lesser developed countries [microform] : hearings before the Subcommittee on Investigations and Oversight and the Subcommittee on Science, Research and Technology of the Committee on Science and Technology, U.S. House of Representatives, Ninety-seventh Congress, second session, May 19, July 15, 1982.

"No. 137."

A dictionary of chemistry, exhibiting the present state of the theory and practice of that science, its application to natural philosophy, the processes of manufactures, metallurgy, and numerous other arts dependant on the properties and habitudes of bodies, in the mineral, vegetable, and animal kingdoms. With a considerable number of tables, expressing the elective attractions, specific gravities, comparative heats, component parts, combinations, and other affections of the objects of chemical research. Illustrated with engravings.

Paged continuously.

Selling; the principles of the science of salesmanship; methods and systems of selling in various lines,

Mode of access: Internet.

A system of logic, ratiocinative and inductive : being a connected view of the principles of evidence, and methods of scientific investigation /

Printer's statement on verso of title page: London: Harrison and Co., Printers, St. Martin's Lane.

A new theoretical and practical treatise on navigation: in which the auxiliary branches of mathematics and astronomy, comprised of algebra, geometry ... etc., are treated of. Also, the theory and most simple methods of finding time, latitude and longitude ...

Mode of access: Internet.

Continuous-current dynamos in theory and practice : with details of methods and formulae used in construction. A practical handbook for designers, manufacturers, and users.

Mode of access: Internet.

Using the EM Algorithm to Train Neural Networks: Misconceptions and a New Algorithm for Multiclass Classification

The expectation-maximization (EM) algorithm has been of considerable interest in recent years as the basis for various algorithms in application areas of neural networks such as pattern recognition. However, there exists some misconceptions concerning its application to neural networks. In this paper, we clarify these misconceptions and consider how the EM algorithm can be adopted to train multilayer perceptron (MLP) and mixture of experts (ME) networks in applications to multiclass classification. We identify some situations where the application of the EM algorithm to train MLP networks may be of limited value and discuss some ways of handling the difficulties. For ME networks, it is reported in the literature that networks trained by the EM algorithm using iteratively reweighted least squares (IRLS) algorithm in the inner loop of the M-step, often performed poorly in multiclass classification. However, we found that the convergence of the IRLS algorithm is stable and that the log likelihood is monotonic increasing when a learning rate smaller than one is adopted. Also, we propose the use of an expectation-conditional maximization (ECM) algorithm to train ME networks. Its performance is demonstrated to be superior to the IRLS algorithm on some simulated and real data sets.

Ex ante evaluations of alternate data structures for end user queries: Theory and experimental test

The data structure of an information system can significantly impact the ability of end users to efficiently and effectively retrieve the information they need. This research develops a methodology for evaluating, ex ante, the relative desirability of alternative data structures for end user queries. This research theorizes that the data structure that yields the lowest weighted average complexity for a representative sample of information requests is the most desirable data structure for end user queries. The theory was tested in an experiment that compared queries from two different relational database schemas. As theorized, end users querying the data structure associated with the less complex queries performed better Complexity was measured using three different Halstead metrics. Each of the three metrics provided excellent predictions of end user performance. This research supplies strong evidence that organizations can use complexity metrics to evaluate, ex ante, the desirability of alternate data structures. Organizations can use these evaluations to enhance the efficient and effective retrieval of information by creating data structures that minimize end user query complexity.