7484630
A Graduate Level Expert Systems Course
This article presents an approach to a graduate-level course in expert, knowledge-based, problem-solving systems. The core of the course, and this article, is a set of questions called a profile, that can be used to characterize and compare each system studied.
13541175
Evaluating Network Serviceability
Abstract The capability to manage network operations on a day-to-day basis has become an important area of concern given the rapid expansion of computer networks. A related, but much less studied area, is the impact that the design of a network has on the ease with which it can be serviced. Evaluating the ease of servicing the network and its components does not concentrate on day-to-day operations of the network, but rather examines the network design over a longer term to identify problematic components, configurations and dependencies between components based on expert knowledge and historical data. This paper reports on our experience with a system to evaluate the ease of servicing a network—its serviceability—given a description of its design. The motivation for the work is that computer networks are more often “grown” than “designed” without concern for serviceability issues. The work also examines the impact of dependencies between components on the role of service and the potential disruption costs caused by these dependencies. This work is important because it is pro-active in explicitly considering the role of servicing a network when changing the components or configuration of a network. This approach is in contrast to network management, which is reactive in dealing with problems. The paper reports on a successful implementation of such as system and our experiences with it.
6315058
Knowledge and Control for a Mechanical Design Expert System
A new variety of Oriental hybrid lily plant bearing large upright-facing flowers particularly characterized by their clear pink coloration with deeper midribs, their large size and substance, and their upright to semi-upright orientation, the flowers being of excellent form and long persistence both on the plant and as cut flowers. This combination is completely new in the Oriental hybrid divisions of lilies suited to forcing and to mass commercial cultivation. The plant is an excellent garden plant, highly resistant to disease and shows tolerance of virus; the bulbs may be precooled and forced for cut flower production and the clone is vigorous, a good grower and a good propagator.
14384022
Designing semantics-preserving cluster representatives for scientific input conditions
In scientific domains, knowledge is often discovered from experiments by grouping or clustering them based on the similarity of their output. The causes of similarity are analyzed based on the input conditions characterizing a given type of output, i.e., a given cluster. This analysis helps in applications such as decision support in industry. Cluster representatives form at-a-glance depictions for such applications. Randomly selecting a set of conditions in a cluster as its representative is not sufficient since distinct combinations of inputs could lead to the same cluster. In this paper, an approach called DesCond is proposed to design semantics-preserving cluster representatives for scientific input conditions. We define a notion of distance for conditions to capture semantics based on the types of their attributes and their relative importance. Using this distance, methods of building candidate cluster representatives with different levels of detail are proposed. Candidates are compared using the DesCond Encoding proposed in this paper that assesses their complexity and information loss, given user interests. The candidate with the lowest encoding for each cluster is returned as its designed representative. DesCond is evaluated with real data from Materials Science. Evaluation with domain expert interviews and formal user surveys shows that designed representatives consistently outperform randomly selected ones and different candidates suit different users.
327923
Implicit interest indicators
Recommender systems provide personalized suggestions about items that users will find interesting. Typically, recommender systems require a user interface that can ``intelligently'' determine the interest of a user and use this information to make suggestions. The common solution, ``explicit ratings'', where users tell the system what they think about a piece of information, is well-understood and fairly precise. However, having to stop to enter explicit ratings can alter normal patterns of browsing and reading. A more ``intelligent'' method is to useimplicit ratings, where a rating is obtained by a method other than obtaining it directly from the user. These implicit interest indicators have obvious advantages, including removing the cost of the user rating, and that every user interaction with the system can contribute to an implicit rating.
Current recommender systems mostly do not use implicit ratings, nor is the ability of implicit ratings to predict actual user interest well-understood. This research studies the correlation between various implicit ratings and the explicit rating for a single Web page. A Web browser was developed to record the user's actions (implicit ratings) and the explicit rating of a page. Actions included mouse clicks, mouse movement, scrolling and elapsed time. This browser was used by over 80 people that browsed more than 2500 Web pages.
Using the data collected by the browser, the individual implicit ratings and some combinations of implicit ratings were analyzed and compared with the explicit rating. We found that the time spent on a page, the amount of scrolling on a page and the combination of time and scrolling had a strong correlation with explicit interest, while individual scrolling methods and mouse-clicks were ineffective in predicting explicit interest.
195710721
Special Issue: Machine Learning in Design
This issue of AIEDAM is based on a workshop on Machine Learning in Design held at the 1996 Conference on Artificial Intelligence in Design, AID'96 (Gero & Sudweeks, 1996), the third of such workshops, with the previous two being held at AID'92 (Gero, 1992) and at AID'94 (Gero & Sudweeks, 1994). The first two workshops also resulted in special issues of AIEDAM (Maher et al., 1994; Duffy et al., 1996).
1207779
Experience in Teaching a Management-Oriented Capstone Software Engineering Course
Many computer science departments teach a capstone software engineering course involving the design and implementation of a large-scale project. Such a course is normally taught with students working together in teams; consequently, students must face a number of problems related to project management and team dynamics. Our experience has been that students frequently fail to adequately cope with these organizational problems, and consequently fail to complete their projects at an acceptable level of quality. To prepare students to better face these problems, we have modified our capstone software engineering course to provide equal emphasis in both management and technical areas. Our approach to management topics is formal rather than anecdotal, stressing general principles applied to organizational problems arising specifically from situations that occur frequently in technical organizations. This paper reports on the structure of this course, and provides insight into our initial experience in teaching it.
3504482
An Intelligent Test Data Generator for Software Branch Coverage
2572723
Using a Markov network model in a univariate EDA: an empirical cost-benefit analysis
This paper presents an empirical cost-benefit analysis of an algorithm called Distribution Estimation Using MRF with direct sampling (DEUMd). DEUMd belongs to the family of Estimation of Distribution Algorithm (EDA). Particularly it is a univariate EDA. DEUMd uses a computationally more expensive model to estimate the probability distribution than other univariate EDAs. We investigate the performance of DEUMd in a range of optimization problem. Our experiments shows a better performance (in terms of the number of fitness evaluation needed by the algorithm to find a solution and the quality of the solution) of DEUMd on most of the problems analysed in this paper in comparison to that of other univariate EDAs. We conclude that use of a Markov Network in a univariate EDA can be of net benefit in defined set of circumstances.
2693848
A parallel heuristic for quadratic assignment problems
Abstract The quadratic assignment problem represents an important class of problems with applications as diverse as facility layout and data analysis. The importance of these applications coupled with the fact that the quadratic assignment problem is NP-hard has encouraged the development of heuristics because optimal seeking procedures have been restricted to very small versions of the problem. This paper describes a new parallel heuristic, SAGA, for the quadratic assignment problem. SAGA is a cascaded hybrid of a genetic algorithm and simulated annealing. In addition to details regarding SAGA and its implementation, this paper also describes the performance of SAGA on two standard problems taken from the literature. The results from these problems show SAGA to be superior to the most commonly employed heuristic in solution quality, and for large problems it is also superior in solution time.
12974717
A System for Learning Routes and Schedules with Genetic Algorithms