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.
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.
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.
2001151
Mapping nominal values to numbers for effective visualization
Data sets with a large number of nominal variables, some with high cardinality, are becoming increasingly common and need to be explored. Unfortunately, most existing visual exploration displays are designed to handle numeric variables only. When importing data sets with nominal values into such visualization tools, most solutions to date are rather simplistic. Often, techniques that map nominal values to numbers do not assign order or spacing among the values in a manner that conveys semantic relationships. Moreover, displays designed for nominal variables usually cannot handle high cardinality variables well. This paper addresses the problem of how to display nominal variables in general-purpose visual exploration tools designed for numeric variables. Specifically, we investigate (1) how to assign order and spacing among the nominal values, and (2) how to reduce the number of distinct values to display. We propose that nominal variables be pre-processed using a distance-quantification-classing (DQC) approach before being imported into a visual exploration tool. In the distance step, we identify a set of independent dimensions that can be used to calculate the distance between nominal values. In the quantification step, we use the independent dimensions and the distance information to assign order and spacing among the nominal values. In the classing step, we use results from the previous steps to determine which values within a variable are similar to each other and thus can be grouped together. Each step in the DQC approach can be accomplished by a variety of techniques. We extended the XmdvTool package to incorporate this approach. We evaluated our approach on several data sets using a variety of evaluation measures.
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).
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.
1464370
Integer programming approaches to haplotype inference by pure parsimony
In 2003, Gusfield introduced the haplotype inference by pure parsimony (HIPP) problem and presented an integer program (IP) that quickly solved many simulated instances of the problem. Although it solved well on small instances, Gusfield's IP can be of exponential size in the worst case. Several authors have presented polynomial-sized IPs for the problem. In this paper, we further the work on IP approaches to HIPP. We extend the existing polynomial-sized IPs by introducing several classes of valid cuts for the IP. We also present a new polynomial-sized IP formulation that is a hybrid between two existing IP formulations and inherits many of the strengths of both. Many problems that are too complex for the exponential-sized formulations can still be solved in our new formulation in a reasonable amount of time. We provide a detailed empirical comparison of these IP formulations on both simulated and real genotype sequences. Our formulation can also be extended in a variety of ways to allow errors in the input or model the structure of the population under consideration
14054763
The use of functional domains to improve transmembrane protein topology prediction
Transmembrane proteins affect vital cellular functions and pathogenesis, and are a focus of drug design. It is difficult to obtain diffraction quality crystals to study transmembrane protein structure. Computational tools for transmembrane protein topology prediction fill in the gap between the abundance of transmembrane proteins and the scarcity of known membrane protein structures. Their prediction accuracy is still inadequate: TMHMM, the current state-of-the-art method, has less than 52% accuracy in topology prediction on one set of transmembrane proteins of known topology. Based on the observation that there are functional domains that occur preferentially internal or external to the membrane, we have extended the model of TMHMM to incorporate functional domains, using a probabilistic approach originally developed for computational gene finding. Our extension is better than TMHMM in predicting the topology of transmembrane proteins. As prediction of functional domain improves, our system's prediction accuracy will likely improve as well.
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.
34188181
Literacy and Numeracy Edutainment Packages for Disaffected Young Learners
The UK Government has conducted research into skills gaps within the UK population. It has concluded that there is an alarmingly large proportion of the population with low literacy and numeracy skills.