The opening book is an important component of a chess engine, and thus computer chess programmers have been developing automated methods to improve the quality of their books. For chess, which has a very rich opening theory, large databases of high-quality games can be used as the basis of an opening book, from which statistics relating to move choices from given positions can be collected. In order to find out whether the opening books used by modern chess engines in machine versus machine competitions are ``comparable'' to those used by chess players in human versus human competitions, we carried out analysis on 26 test positions using statistics from two opening books one compiled from humans' games and the other from machines' games. Our analysis using several nonparametric measures, shows that, overall, there is a strong association between humans' and machines' choices of opening moves when using a book to guide their choices.

The k -modes algorithm [1] extends the k -means paradigm to cluster categorical data by using (1) a simple matching dissimilarity measure for categorical objects, (2) modes instead of means for clusters, and (3) a frequency-based method to update modes in the k -means fashion to minimize the cost function of clustering. Because the k -modes algorithm uses the same clustering process as k -means, it preserves the efficiency of the k -means algorithm. Although the k -modes algorithm is very efficient, it suffers the problem that the clustering results are sensitive to the selection of the initial points. Hence, a better initial points selection procedure would improve the reliability and accuracy of clustering results. To that end, an iterative initial-points refinement algorithm for k -modes clustering has been presented in [2]. As shown in [2], the new initialization pr ocedure greatly improves the reliability and accuracy of final clustering results. Despite the su ccess of Ref. [2], the following observations motivate us to further pursue other alternative initialization methods.

There has been a lot of recent interest in mining patterns from graphs. Often, the exact structure of the patterns of interest is not known. This happens, for example, when molecular structures are mined to discover fragments useful as features in chemical compound classification task, or when web sites are mined to discover sets of web pages representing logical documents. Such patterns are often generated from a few small subgraphs (cores), according to certain generalization rules (GRs). We call such patterns "generalized patterns"(GPs). While being structurally different, GPs often perform the same function in the network. Previously proposed approaches to mining GPs either assumed that the cores and the GRs are given, or that all interesting GPs are frequent. These are strong assumptions, which often do not hold in practical applications. In this paper, we propose an approach to mining GPs that is free from the above assumptions. Given a small number of GPs selected by the user, our algorithm discovers all GPs similar to the user examples. First, a machine learning-style approach is used to find the cores. Second, generalizations of the cores in the graph are computed to identify GPs. Evaluation on synthetic data, generated using real cores and GRs from biological and web domains, demonstrates effectiveness of our approach.

We are presenting a method to recognise geographical references in free text. Our tool must work on various languages with a mi ni-mum of language-dependent resources, except a gazetteer. The main difficulty is to disa mbiguate these place names by distinguis hing places from persons and by selecting the mo st likely place out of a list of homographi c place names world-wide. The system uses a number of language-independent clues and he uristics to disambiguate place name homogra phs. The final aim is to index texts with the countries and cities they mention and to automatically visualise this information on geographical maps using various tools.

We present an exploratory tool that extracts person names from multilingual news collections, matches name variants referring to the same person, and infers relationships between people based on the co-occurrence of their names in related news. A novel feature is the matching of name variants across languages and writing systems, including names written with the Greek, Cyrillic and Arabic writing system. Due to our highly multilingual setting, we use an internal standard representation for name representation and matching, instead of adopting the traditional bilingual approach to transliteration. This work is part of the news analysis system NewsExplorer that clusters an average of 25,000 news articles per day to detect related news within the same and across different languages.

In this note we introduce the notion of islands for restricting local search. We show how we can construct islands for CNF SAT problems, and how much search space can be eliminated by restricting search to the island.

Although it has contributed to remarkable improvements in some specific areas, attempts to develop a universal design theory are generally characterized by failure. This paper sketches arguments for a new approach to engineering design based on Semiotics - the science about signs. The approach is to combine different design theories over all the product life cycle stages into one coherent and traceable framework. Besides, it is to bring together the designer's and user's understandings of the notion of 'good product'. Building on the insight from natural sciences that complex systems always exhibit a self-organizing meaning-influential hierarchical dynamics, objective laws controlling product development are found through an examination of design as a semiosis process. These laws are then applied to support evolutionary design of products. An experiment validating some of the theoretical findings is outlined, and concluding remarks are given.

Although a number of Computer Aided Process Planni ng (CAPP) systems have been implemented, human planners are still irreplaceable for actual manufacturing. Because process planning requires multiple types of human expertise, there is a common trend to apply knowledge-based techniques for solving the process planning tasks. This circumstance is conducive to developing so-called CAPP Expert Systems (CAPPES). A few approaches to building CAPPES can be found through means-aids analysis of the research literature since 1980. At the same time, it can be seen that authors' efforts in those papers have mostly been made in special cases of CA PPES implementation, whereas the problem of "How to develop CAPPES" on the whole is still open. Se veral general conceptions and methodologies for CAPP have been published, but no fairly versatile technology is yet known. The aim of the paper is to consider the us age of logical models for development of a CAPPES building technology.

The research results described are concerned with: - developing a domain modeling method and tools to provide the design and implementation of decision-making support systems for computer integrated manufacturing; - building a decision-making support system based on know-how and its software environment. The research is funded by NEDO, Japan.

In the late 90th, the complex of concepts, theories, technologies and software called knowledge-based systems has become a key point in development of many future-oriented manufacturing paradigms, such as Agile Manufacturing and Intelligent Manufacturing Systems. Besides, the progress from craft production, to automated and flexible production and to wards'next generation' production is now realized to be in many respects determined by the human/systems ability to handle the domain knowledge rather than simply by a given standard of knowledge in the domain. This is the motivation for a continuously growing research interest to utilization of manufacturing knowledge. It should be noted however, that while a great many reports on different theoretical and applied aspects of knowle dge utilization have been published, the issues of the specificity of manufacturing knowledge and the appropriateness of the methodologies brought into manufacturing from other domains to build knowledge-based systems have not been given due attention. One instance of this research lack is given in this paper with the phenomenon of know-how. It was discovered rather long ago that know-how plays an important role during the solving of professional tasks in manufacturing (e.g.