34057392
Rule identification from Web pages by the XRML approach
In the world of Web pages, there are oceans of documents in natural language texts and tables. To extract rules from Web pages and maintain consistency between them, we have developed the framework of XRML (eXtensible Rule Markup Language). XRML allows the identification of rules on Web pages and generates the identified rules automatically. For this purpose, we have designed the Rule Identification Markup Language (RIML), which is similar to the formal Rule Structure Markup Language (RSML), both as parts of XRML. RIML 2.0 is designed to identify rules not only from texts, but also from tables on Web pages, and to transform to the formal rules in RSML syntax automatically. While designing RIML 2.0, we considered the features of sharing variables and values, omitted terms, and synonyms. We have conducted an experiment to evaluate the potential benefit of the XRML approach with real world Web pages of Amazon.com, BarnesandNoble.com, and Powells.com. We found that 100.0% of the rules and 99.7% of the rule components could be identified and automatically generated if we do not count the statements for linkages, which generically do not exist on the Web pages. Since the linkage components occupy 11.2% of all components in the rule base, the overall limitation of automatic rule generation is 88.8%. In this setting, 88.5% of the overall rule components could be generated from the identified rules from the Web pages. The result provides solid proof that XRML can facilitate the extraction and maintenance of rules from Web pages while building expert systems in the Semantic Web environment.
2979889
An effective customization procedure with configurable standard models
In electronic catalogs, commodities such as computers and electronic equipment are specified as standard models although a variety of possible alternative specifications can exist as a combination of selected options; therefore, customized configurations are essential to support various customers with individual needs. Thus, the problem here is the selection of a standard model and reconfiguration with this selected model. An issue is that requirements may be fulfilled by more than one standard model. To develop an algorithm that can find the near minimum price without causing unacceptable computation effort, we devised the Standard Model Selection and Modification (SMSM) Algorithm. To establish the SMSM Algorithm, we propose the Concurrent Local Propagation procedure complemented with pruning capability owing to the nature of standard models. The effective strategies for selection of seed variables and stopping rules are devised through comparative experiments.For the experiment, we use Dell's personal computer (PC) products consisting of 42 standard models with 25 specification variables. The SMSM Algorithm is tested with 75 experimental cases, and we found that the most similar standard models could discover the minimum price only in 24 out of 75 cases and that the SMSM procedure could reduce the price by 6.04% from the one offered by the most similar standard models.
7110658
Automatic Rule Generation by the Transformation of Expert's Diagram: LIFT
Abstract To enhance the efficiency of revealing and refining an expert's knowledge, the Expert's Diagram approach is proposed. The Expert's Diagram proposed in this paper is specifically designed for rule-based consulting systems. Using the Expert's Diagram approach, the knowledge acquisition system LIFT is developed, which transforms the Expert's Diagram automatically to rules in the syntax of the shell SKI 2 that is developed for tax consulting-purposes. For the transformation, either the conclusion-directed approach or the condition-directed approach can be applied. The role of LIFT can be generalized to some extent to adapt to the changes in the Expert's Diagram and target shells. According to our experience in the acquisition of Korean corporate tax knowledge, experts could reveal their knowledge effectively using the Expert's Diagram after a short period of training. Thus the rules could be generated automatically by LIFT without the aid of knowledge engineers.
27969393
Least modification principle for case-based reasoning: a software project planning experience
A software project plan is composed of stages of activities and detailed tasks to be performed, and precedence restrictions among them. A project network is very complex and its construction requires a vast amount of field knowledge and experience. To assist the construction of a software project network, we adopt the case-based reasoning approach. However, the software project network may be designed differently depending upon the adopted development methodology and the style of the manager, so full automation of adjusting a past case is almost impossible. Thus, reducing the modification effort to a minimum is very important for enhancing the project planner's performance. In this research, we develop the framework of the Least Modification Principle (LMP) for Case-based Reasoning to solve this kind of problem. LMP is applicable when a reliable estimation of modification effort is possible. To apply the LMP for project network planning, we have selected 17 factors and the values for each factor to specify software projects. The modification effort is estimated based on the syntactic structure of modification rules. The performance of LMP is demonstrated with each of 31 test cases based on the other 30 past cases. We found that the LMP approach can significantly outperform the Ordinary Factor Matching approach.
6969387
Case- and Constraint-Based Project Planning for Apartment Construction
To effectively generate a fast and consistent apartment construction project network, Hyundai Engineering and Construction and Korea Advanced Institute of Science and Technology developed a case- and constraint-based project-planning expert system for an apartment domain. The system, FAS-TRAK- APT, is inspired by the use of previous cases by a human expert project planner for planning a new project and the modification of these cases by the project planner using his/her knowledge of domain constraints. This large-scale, case-based, and mixed-initiative planning system, integrated with intensive constraint-based adaptation, utilizes semantic-level metaconstraints and human decisions for compensating incomplete cases imbedding specific planning knowledge. The case- and constraint-based architecture inherently supports cross-checking cases with constraints during system development and maintenance. This system has drastically reduced the time and effort required for initial project planning, improved the quality and completeness of the generated plans, and is expected to give the company the competitive advantage in contract bids for new contracts.
6995681
Quasi-optimal case-selective neural network model for software effort estimation
Abstract A number of software effort estimations have attempted using statistical models, case based reasoning, and neural networks. The research results showed that the neural network models perform at least as well as the other approaches, so we selected the neural network model as the estimator. However, since the computing environment changes so rapidly in terms of programming languages, development tools, and methodologies, it is very difficult to maintain the performance of estimation models for the new breed of projects. Therefore, we propose a search method that finds the right level of relevant cases for the neural network model. For the selected case set, the scale of the neural network model can be reduced by eliminating the qualitative input factors with the same values. Since there exist a multitude of combinations of case sets, we need to search for the optimal reduced neural network model and corresponding case set. To find the quasi-optimal model from the hierarchy of reduced neural network models, we adopted the beam search technique and devised the case-set selection algorithm. We have shown that the resulting model significantly outperforms the original full model for the software effort estimation. This approach can be also used for building any case-selective neural network.
11330211
Resolving References to Graphical Objects in Multimodal Queries by Constraint Satisfaction
In natural language queries to an intelligent multimodal system, ambiguities related to referring expressions - source ambiguities - can occur between items in the visual display and objects in the domain being represented. A multimodal interface has to be able to resolve these ambiguities in order to provide satisfactory communication with a user. In this paper, we briefly introduce source ambiguities, and present the formalisation of a constraint satisfaction approach to interpreting singular referring expressions with source ambiguities. In our approach, source ambiguities are resolved simultaneously with other referent ambiguities, allowing flexible access to various sorts of knowledge.
26557344
A Knowledge-Based Approach to Rank Documents for Boolean Queries
26190362
Enumerating branched orientable surface coverings over a non-orientable surface
The isomorphism classes of several types of graph coverings of a graph have been enumerated by many authors [M. Hofmeister, Graph covering projections arising from finite vector space over finite fields, Discrete Math. 143 (1995) 87-97; S. Hong, J.H. Kwak, J.Lee, Regular graph coverings whose covering transformation groups have the isomorphism extention property, Discrete Math. 148 (1996) 85-105; J.H. Kwak, J.H. Chun, J. Lee, Enumeration of regular graph coverings having finite abelian covering transformation groups, SIAM J. Discrete Math. 11 (1998) 273-285; J.H. Kwak, J. Lee, Isomorphism classes of graph bundles, Canad. J. Math. XLII (1990) 747-761; J.H. Kwak, J. Lee, Enumeration of connected graph coverings, J. Graph Theory 23 (1996) 105-109]. Recently, Kwak et al [Balanced regular coverings of a signed graph and regular branched orientable surface coverings over a non-orientable surface, Discrete Math. 275 (2004) 177-193] enumerated the isomorphism classes of balanced regular coverings of a signed graph, as a continuation of an enumeration work done by Archdeacon et al [Bipartite covering graphs, Discrete Math. 214 (2000) 51-63] the isomorphism classes of branched orientable regular surface coverings of a non-orientable surface having a finite abelian covering transformation group. In this paper, we enumerate the isomorphism classes of connected balanced (regular or irregular) coverings of a signed graph and those of unbranched orientable coverings of a non-orientable surface, as an answer of the question raised by Liskovets [Reductive enumeration under mutually orthogonal group actions, Acta-Appl. Math. 52 (1998) 91-120]. As a consequence of these two results, we also enumerate the isomorphism classes of branched orientable surface coverings of a non-orientable surface. Acta-Appl. Math. 52 (1998) 91-120]. As a consequence of these two results, we also enumerate the isomorphism classes of branched orientable surface coverings of a non-orientable surface.
14116288
A Practitioner's Approach to Normalizing XQuery Expressions
XQuery becomes a standard of the XML query language. Just like in SQL, XQuery allows nested expressions. To optimize XQuery processing, a lot of research has been done on normalization, i.e., transforming nested expressions to equivalent unnested ones. Previous normalization rules are classified into two categories – source-level and algebra-level – depending on whether a construct is specified by using a query language or an algebraic expression. In implementation point of view, we contend that the source-level rule is preferable to the algebra-level rule because algebras used for normalization are hard to be directly exploited in a typical DBMS. However, a complete set of source-level rules is yet to be developed. In this paper, we propose source-level rules for normalizing XQuery expressions and present an implementation mechanism. We show that our rules are correct and complete according to the nesting types classified by Kim. Our mechanism is easily implementable since it adapts the well-known Query Graph Model (QGM) representation. We have successfully implemented this mechanism into our XML DBMS named Odysseus/XML.
46124956
The formal definition of the BASIC language
The translator The translator which transforms the parsed text into the abstract text (that is, a text which conforms to the abstract syntax and takes into account the default conditions) is peculiar to the language in the Lucas system but has not been developed here since it is the author's opinion that a general translator may be developed which is applicable to all languages. The default rules for Basic are: