Expert identification and selection: Legal liability concerns and directions

Legal liabilities pertaining to the identification and selection of domain experts is an issue that could adversely impact expert systems developers. Problems pertaining to flawed knowledge, improperly defined expertise, and behavioural and psychological impediments are just some of the issues. This paper examines the torts of strict products liability and negligence that system developers could incur as a result of expert-related difficulties. Parallels from legal scholars and federal and state court decisions are discussed relevant to expert system projects and developers. The paper concludes with a presentation of steps that systems developers can take to minimize potential legal liability.     

Integration of knowledge-based systems with data processing

Transaction Oriented Prolog-Online Environment is a multi-user, mainframe implementation of the logic programming language Prolog, specially designed and developed for the data processing environment. This article describes the background, functionality, implementation and use of TOP-ONE, stressing that applications of knowledge-based systems technology to data processing environments will achieve full success only when existing systems and existing conventional data are incorporated within the applications.     

Complexity theory of parallel time and hardware

The parallel resources time and hardware and the complexity classes defined by them are studied using the aggregate model. The equivalence of complexity classes defined by sequential space and uniform aggregate hardware is established. Aggregate time is related to (bounded fanin) circuit depth and, similarly, aggregate hardware is related to circuit width. Interelationships between aggregate time and hardware follow as corollaries. Aggregate time is related to the sequential resource reversal. Simultaneous relationships from aggregate hardware and time to sequential space and reversal are shown (and conversely), and these are used as evidence for an “extended parallel computation thesis.” These simultaneous relationships provide new characterizations for the simultaneous parallel complexity class NC and for the complementary class SC. The evaluation of monotone planar circuits is shown to be in NC, in fact in LOGCFL.     

Evidence for Remote Effects of Dreissenid Mussels on the Amphipod Diporeia: Analysis of Lake Ontario Benthic Surveys, 1972–2003

The status of invasive dreissenid mussels (Dreissena polymorpha and D. bugensis) and native amphipods (Diporeia spp.) in Lake Ontario was assessed in 2003 and compared with historical data. D. polymorpha (zebra mussels) were rarely observed in 2003, having been displaced by D. bugensis (quagga mussels). D. bugensis expanded its depth range from 38 m depth in 1995 to 174 m in 2003 and this dreissenid reached densities averaging 8,000/m² at all sites < 90 m. During the same time period, Diporeia populations almost completely disappeared from 0–90 m depth, continuing a declining trend from 1994–1997 reported in previous studies. The average density of Diporeia in the 30–90 m depth interval decreased from 1,380/m² to 63/m² between 1997 and 2003. Prior to 2003, areas deeper than 90 m represented a refuge for Diporeia, but even these deep populations decreased, with densities declining from 2,181/m2 in 1999 to 545/m2 in 2003. Two common hypotheses for the decline of Diporeia in the Great Lakes are food limitation and a toxin/pathogen associated with dreissenid pseudofeces. The Diporeia decline in deep waters preceded the expansion of D. bugensis to these depths, and suggests that shallow dreissenid populations remotely influence profundal habitats. This pattern of decline is consistent with mechanisms that act from some distance including nearshore dreissenid grazing and downslope transport of pseudofeces.     

Prediction of fatigue behaviour in stress-concentrators of arbitrary geometry

A new method is outlined which aims to predict high-cycle fatigue behavior of components which fail from stress-concentrators. This involves examination of the stress field in the vicinity of the stress-concentrator, and comparison with stress fields for cracks at known stress intensities. Methods which are currently used for simple notch geometries can thus be generalised, making the approach applicable to stress concentrators of any geometry. The method of prediction is shown to be stable, providing a solution of good accuracy when compared to analytical methods for standard specimen geometries. Favourable comparisons with experimental data have been achieved both for standard notches and for a corner geometry which represents a typical component case.     

The computer-aided design of microwave matching networks

Matching networks, as used between the consecutive stages of an amplifier to manage the transfer of power between the complex source impedance, the active devices, and the load, continue to be of importance, particularly in microwave systems. Synthesis techniques for these networks have evolved from the classical theory to novel numerical approaches that yield significant practical advantages. We review here several well-known design methods, including the classical derivation, sloped-approximation synthesis, and the real-frequency technique. Also considered are enhancements and variations of these methods. Furthermore, we describe the iterated analysis approach, which appears to provide the greatest design flexibility, efficiency, and accuracy to date. Examples are given which illustrate the relative merits of some of the more modern computer-assisted techniques. Finally, we discuss ideas for further research in the area of matching network synthesis.     

Formatting texts accessed randomly

Full-text systems that access text randomly cannot normally determine the format operations in effect for a given target location. The problem can be solved by viewing the format marks as the non-terminals in a format grammar. A formatted text can then be parsed using the grammar to build a data structure that serves both as a parse tree and as a search tree. While processing a retrieved segment, a full-text system can follow the search tree from root to leaf, collecting the format marks encountered at each node to derive the sequence of commands active for that segment. The approach also supports the notion of a ‘well formatted’ document and provides a means for verifying the well-formedness of a given text. To illustrate the approach, a sample set of format marks and a sample grammar are given suitable for formatting and parsing the article as a sample text.     

Active symbols and internal models: Towards a cognitive connectionism

In the first section of the article, we examine some recent criticisms of the connectionist enterprise: first, that connectionist models are fundamentally behaviorist in nature (and, therefore, non-cognitive), and second that connectionist models are fundamentally associationist in nature (and, therefore, cognitively weak). We argue that, for a limited class of connectionist models (feed-forward, pattern-associator models), the first criticism is unavoidable. With respect to the second criticism, we propose that connectionist modelsare fundamentally associationist but that this is appropriate for building models of human cognition. However, we do accept the point that there are cognitive capacities for which any purely associative model cannot provide a satisfactory account. The implication that we draw from is this is not that associationist models and mechanisms should be scrapped, but rather that they should be enhanced.In the next section of the article, we identify a set of connectionist approaches which are characterized by active symbols — recurrent circuits which are the basis of knowledge representation. We claim that such approaches avoid criticisms of behaviorism and are, in principle, capable of supporting full cognition. In the final section of the article, we speculate at some length about what we believe would be the characteristics of a fully realized active symbol system. This includes both potential problems and possible solutions (for example, mechanisms needed to control activity in a complex recurrent network) as well as the promise of such systems (in particular, the emergence of knowledge structures which would constitute genuine internal models).