33879094
Defining configuring
This paper is intended to serve as part of the context in which the other papers in this special issue should be read. Its main goal is to revisit the basic definition of the configuration task, on which many people depend, to show some of its flaws, and to point out how it shapes thinking about the problem. We are concerned about characterizing the reasoning processes used to produce a configuration.
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.
8925359
Using Design History Systems for Technology Transfer
This paper presents the concept of a Design History System (DHS), and describes a protoype DHS called the Process Technology Transfer Tool (PTTT) which was designed to aid in transferring process design information between Advanced Development and Manufacturing.
29206629
Inferring User Interest
As the World Wide Web continues to grow, people find it impossible to access even a small portion of the information generated in a day from Usenet news, e-mail, and Web postings. Automated filters help us to prioritize and access only the information in which we're interested. Because opinions differ about the importance or relevance of information, people need personalized filters. Implicit indicators captured while users browse the Web can be as predictive of interest levels as explicit ratings.
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.
33488472
Expert System Assisted Test Data Generation for Software Branch Coverage
Abstract With the increased production of complex software systems, verification and validation (V & V) has evolved into a set of activities that span the entire software life cycle. Among these various activities, software testing plays a major role in V&V. Conventional software testing methods generally require considerable manual effort which can generate only a limited number of test cases before the amount of time expended becomes unacceptably large. In this paper, we present a new approach to generating test cases based on artificial intelligence methods. By analyzing the branch coverage of previous test cases, an expert system is able to generate new test cases which provide additional coverage. Heuristic rules are used to modify previous test cases in order to achieve the desired branch coverage. This approach to software testing has the potential for greatly reducing the overall costs associated with branch coverage testing.
44788901
Parallel genetic algorithms with local search
This paper presents methods of applying local search to global optimization problems. The most common approach, multistart, selects the best solution from restarts of local search from random starting points. Partitional methods augment local search with general principles concerning the location of global optima in real space, significantly improving the effectiveness of local search in function optimization problems. Standard partitional methods, however, are not directly applicable to combinatorial optimization problems. We describe a genetic algorithm, GALO, that is similar to the partitional methods, but can be applied to combinatorial problems. Empirical results are presented for a parallel implementation of GALO that show it to be effective for the quadratic assignment problem.
3504482
An Intelligent Test Data Generator for Software Branch Coverage
8351261
Subfamily HMMS in Functional Genomics
The limitations of homology-based methods for prediction of protein molecular function are well known; differences in domain structure, gene duplication events and errors in existing database annotations complicate this process. In this paper we present a method to detect and model protein subfamilies, which can be used in high-throughput, genome-scale phylogenomic inference of protein function. We demonstrate the method on a set of nine PFAM families, and show that subfamily HMMs provide greater separation of homologs and non-homologs than is possible with a single HMM for each family. We also show that subfamily HMMs can be used for functional classification with a very low expected error rate. The BETE method for identifying functional subfamilies is illustrated on a set of serotonin receptors.
15121856
Agent-based and analytical modeling to evaluate the effectiveness of greenbelts
We present several models of residential development at the rural–urban fringe to evaluate the effectiveness of a greenbelt located beside a developed area, for delaying development outside the greenbelt. First, we develop a mathematical model, under two assumptions about the distributions of service centers, that represents the trade-off between greenbelt placement and width, their effects on the rate of development beyond the greenbelt, and how these interact with spatial patterns of aesthetic quality and the locations of services. Next, we present three agent-based models (ABMs) that include agents with the potential for heterogeneous preferences and a landscape with the potential for heterogeneous attributes. Results from experiments run with a one-dimensional ABM agree with the starkest of the results from the mathematical model, strengthening the support for both models. Further, we present two different two-dimensional ABMs and conduct a series of experiments to supplement our mathematical analysis. These include examining the effects of heterogeneous agent preferences, multiple landscape patterns, incomplete or imperfect information available to agents, and a positive aesthetic quality impact of the greenbelt on neighboring locations. These results suggest how width and location of the greenbelt could help determine the effectiveness of greenbelts for slowing sprawl, but that these relationships are sensitive to the patterns of landscape aesthetic quality and assumptions about service center locations. # 2004 Elsevier Ltd. All rights reserved.