Search

In this paper we propose a novel personalized paper search system using the relevance among user's queried keywords and user's behaviors on a searched paper list. The proposed system builds user's individual relevance network from analyzing the appearance frequencies of keywords in the searched papers. The relevance network is personalized by providing weights to the appearance frequencies of keywords according to users' behaviors on the searched list, such as "downloading," "opening," and "no-action." In the experimental section, we demonstrate our method using 100 faculties' search information in the University of Suwon. [ABSTRACT FROM AUTHOR]

This paper is concerned with a multi-resolution tool for screening paper formation variations in various frequency regions on production line. A paper web is illuminated by two red diode lasers and the reflected light recorded as two time series of high resolution measurements constitute the input signal to the papermaking process monitoring system. The time series are divided into blocks and each block is analyzed separately. The task is treated as kernel based novelty detection applied to a multi-resolution time series representation obtained from the band-pass filtering of the Fourier power spectrum of the series. The frequency content of each frequency region is characterized by a feature vector, which is transformed using the canonical correlation analysis and then categorized into the inlier or outlier class by the novelty detector. The ratio of outlying data points, significantly exceeding the predetermined value, indicates abnormalities in the paper formation. The tools developed are used for online paper formation monitoring in a paper mill. [ABSTRACT FROM AUTHOR]

This article proposes a Memetic Differential Evolution (MDE) for designing digital filters which aim at detecting defects of the paper produced during an industrial process. The MDE is an adaptive evolutionary algorithm which combines the powerful explorative features of Differential Evolution (DE) with the exploitative features of two local searchers. The local searchers are adaptively activated by means of a novel control parameter which measures fitness diversity within the population. Numerical results show that the DE framework is efficient for the class of problems under study and employment of exploitative local searchers is helpful in supporting the DE explorative mechanism in avoiding stagnation and thus detecting solutions having a high performance. [ABSTRACT FROM AUTHOR]

This paper is concerned with a multi-resolution tool for analysis of a time series aiming to detect abnormalities in various frequency regions. The task is treated as a kernel based novelty detection applied to a multi-level time series representation obtained from the discrete wavelet transform. Having a priori knowledge that the abnormalities manifest themselves in several frequency regions, a committee of detectors utilizing data dependent aggregation weights is build by combining outputs of detectors operating in those regions. [ABSTRACT FROM AUTHOR]

One of the simplest protocols for clock synchronization in wireless ad hoc and sensor networks is the converge-to-max protocol, which has the simple logic of adjusting each node's clock to be at least as large as any neighbor's. This paper examines the converge-to-max protocol, showing it to be stabilizing even when node clocks have skew, bounded domains, and dynamic communication links. [ABSTRACT FROM AUTHOR]

This paper presents the advantage that knowledge-intensive activities, such as Scientific Conference Management, can take by the exploitation of expert components in the key tasks. Typically, in this domain the task of scheduling the activities and resources or the assignment of reviewers to papers is performed manually leading therefore to time-consuming procedures with high degree of inconsistency due to many parameters and constraints to be considered. The proposed systems, evaluated on real conference datasets, show good results compared to manual scheduling and assignment, in terms of both accuracy and reduction of runtime. [ABSTRACT FROM AUTHOR]

The techniques for organizing and retrieving the artifacts from digital libraries (DLs) semantically are discussed, which include letting the taxonomies and semantic relations work in tandem to index the artifacts in DLs; integrating the techniques used in natural language processing and taxonomies to help users to start their retrieval processes; and ranking scientific papers on similarity in terms of contents or ranking the relevant papers on multi-factors. These techniques are verified through the design and implementation of a prototype of DLs for scientific paper management. [ABSTRACT FROM AUTHOR]

The aim of this paper is to give theoretical and experimental tools for measuring the driving force in evolving complex networks. First a discrete-time stochastic model framework is introduced to state the question of how the dynamics of these networks depend on the properties of the parts of the system. Then a method is presented to determine this dependence in the possession of the required data about the system. This measurement method is applied to the citation network of high energy physics papers to extract the in-degree and age dependence of the dynamics. It is shown that the method yields close to "optimal" results. [ABSTRACT FROM AUTHOR]

Nowadays amount of information on Internet is dramatically increasing. The ability of facilitating users to achieve useful information is more and more important for search field. CDSE, a model for the domain-based intelligent search engine is proposed in this paper. The model can help users to retrieve what they need by combining text classification with keywords extraction. Several algorithms that use key technologies are proposed, such as statistics, data mining and agents. Then a new criterion named ranking error is contributed to solve the problem of evaluation ranking inefficiency in traditional performance evaluation methodologies. The experimental results indicate that the proposed model can effectively improve retrieval precision and solve the problem of relevant document ranking behind in current search engine. [ABSTRACT FROM AUTHOR]

The paper discusses a distributed approach for monitoring and diagnosing the execution of a plan where concurrent actions are performed by a team of cooperating agents. The paper extends the notion of plan diagnosis(introduced by Roos et al. for the execution of a multi-agent plan) with the notion of agent diagnosis. While plan diagnosis is able to capture the distinction between primary and secondary failures, the agent diagnosis makes apparent the actual health status of the agents. The paper presents a mechanism of failure propagation which captures the interplay between agent diagnosis and plan diagnosis; this mechanism plays a critical role in the understanding at what extent a fault affecting the functionalities of an agent affects the global plan too. A relational formalism is adopted for modeling both the nominal and the abnormal execution of the actions. [ABSTRACT FROM AUTHOR]

Generally, it is difficult to find constant patterns on identifiers in a container image, since the identifiers are not normalized in color, size, and position, etc. and their shapes are damaged by external environmental factors. This paper distinguishes identifier areas from background noises and removes noises by using an ART2-based quantization method and general morphological information on the identifiers such as color, size, ratio of height to width, and a distance from other identifiers. Individual identifier is extracted by applying the 8-directional contour tracking method to each identifier area. This paper proposes a refined ART2-based RBF network and applies it to the recognition of identifiers. Through experiments with 300 container images, the proposed algorithm showed more improved accuracy of recognizing container identifiers than the others proposed previously, in spite of using shorter training time. [ABSTRACT FROM AUTHOR]

Reading and literature exploration are important tasks of scientific research. However, conventional retrieval systems provide limited support for these tasks by concentrating on identifying relevant materials. New generation systems should provide additional support functionality by focusing on analyzing and organizing the retrieved materials. A framework of literature exploration support systems is proposed. Techniques of granular computing are used to construct granular knowledge structures from the contents, structures, and usages of scientific documents. The granular knowledge structures provide a high level understanding of scientific literature and hints regarding what has been done and what needs to be done. As a demonstration, we examine granular knowledge structures obtained from an analysis of papers from two rough sets related conferences. [ABSTRACT FROM AUTHOR]

In this paper we propose a two-pass classification method and apply it to face recognitions. The method is obtained by integrating together two approaches, the hyper-ellipsoid neural networks (HENN's) and the SVM's with error correcting codes. This method realizes a classification operation in two passes: the first one is to get an intermediate classification result for an input sample by using the HENN's, and the second pass is followed by using the SVM's to re-classify the sample based on both the input data and the intermediate result. Simulations conducted in the paper for applications to face recognition showed that the two-pass method can maintain the advantages of both the HENN's and the SVM's while remedying their disadvantages. Compared with the HENN's and the SVM's, a significant improvement of recognition performance over them has been achieved by the new method. [ABSTRACT FROM AUTHOR]

TSP(Traveling Salesman Problem) used widely for solving the optimization is the problem to find out the shortest distance out of possible courses where one starts a certain city, visits every city among N cities and turns back to a staring city. At this time, the condition is to visit N cities exactly only once. TSP is defined easily, but as the number of visiting cities increases, the calculation rate increases geometrically. This is why TSP is classified into NP-Hard Problem. Genetic Algorithm is used representatively to solve the TSP. Various operators have been developed and studied until now for solving the TSP more effectively. This paper applied the new Population Initialization Method (using the Random Initialization method and Induced Initialization method simultaneously), solved TSP more effectively, and proved the improvement of capability by comparing this new method with existing methods. Keywords: Genetic Algorithm, GA, Optimization, Initialization. [ABSTRACT FROM AUTHOR]

This paper proposed an automatic recognition system of shipping container identifiers using fuzzy-based noise removal method and ART2-based self-organizing supervised learning algorithm. Generally, identifiers of a shipping container have a feature that the color of characters is black or white. Considering such a feature, in a container image, all areas excepting areas with black or white colors are regarded as noises, and areas of identifiers and noises are discriminated by using a fuzzy-based noise detection method. Noise areas are replaced with a mean pixel value of the whole image and areas of identifiers are extracted by applying the edge detection by Sobel masking operation and the vertical and horizontal block extraction in turn to the noise-removed image. Extracted areas are binarized by using the iteration binarization algorithm, and individual identifiers are extracted by applying 8-directional contour tracking method. This paper proposed an ART2-based self-organizing supervised learning algorithm for the identifier recognition, which creates nodes of the hidden layer by applying ART2 between the input and the hidden layers and improves the performance of learning by applying generalized delta learning and Delta-bar-Delta algorithm between the hidden and the output layers. Experiments using many images of shipping containers showed that the proposed identifier extraction method and the ART2-based self-organizing supervised learning algorithm are more improved compared with the methods previously proposed. [ABSTRACT FROM AUTHOR]

This paper proposed an automatic recognition system of shipping container identifiers using fuzzy-based noise removal method and ART2-based self-organizing supervised learning algorithm. Generally, identifiers of a shipping container have a feature that the color of characters is black or white. Considering such a feature, in a container image, all areas excepting areas with black or white colors are regarded as noises, and areas of identifiers and noises are discriminated by using a fuzzy-based noise detection method. Noise areas are replaced with a mean pixel value of the whole image and areas of identifiers are extracted by applying the edge detection by Sobel masking operation and the vertical and horizontal block extraction in turn to the noise-removed image. Extracted areas are binarized by using the iteration binarization algorithm, and individual identifiers are extracted by applying 8-directional contour tacking method. This paper proposed an ART2-based self-organizing supervised learning algorithm for the identifier recognition, which creates nodes of the hidden layer by applying ART2 between the input and the hidden layers and improves the performance of learning by applying generalized delta learning and Delta-bar-Delta algorithm between the hidden and the output layers. Experiments using many images of shipping containers showed that the proposed identifier extraction method and the ART2-based self-organizing supervised learning algorithm are more improved compared with the methods previously proposed. [ABSTRACT FROM AUTHOR]

A method based on multi-feature and multi-stage verification is proposed in this paper. The direction and texture features obtained by Gabor filter are used for the first-stage verification. Then the sham dynamic features representing the writing force are used for the second-stage verification. Considering the number of samples for training is limited, the support vector machine (SVM) is selected as the classifier. The experimental results show that this method can not only increase the accuracy, but also satisfy the requirement of speed in real-time system as well. [ABSTRACT FROM AUTHOR]

Accurate cancer classification is very important to cancer diagnosis and treatment. As molecular information is increasing for the cancer classification, a lot of techniques have been proposed and utilized to classify and predict the cancers from gene expression profiles. In this paper, we propose a method based on speciated evolution for the cancer classification. The optimal combination among several feature-classifier pairs from the various features and classifiers is evolutionarily searched using the deterministic crowding genetic algorithm. Experimental results demonstrate that the proposed method is more effective than the standard genetic algorithm and the fitness sharing genetic algorithm as well as the best single classifier to search the optimal ensembles for the cancer classification. [ABSTRACT FROM AUTHOR]

Increasing the smooth degree of data series is key factor of grey model's precision. In this paper, the more general method is put forward on the basis of summarizing several kinds of ways to improve smooth degree of data series, and a new transformation is represented. The practical application shows the effectiveness and superiority of this method. [ABSTRACT FROM AUTHOR]

It presents an approach to the automatic generation of pencil sketching with the effects of paper texture. First, proposes a texture mapping of strokes in the aspect of skeleton, the filter algorithm and the standard deviation algorithm for rendering image, the near distances recover algorithm for real-time browsing, and finally implement the Pen-and-Ink Style of pencil sketching Rendering System. In the static rendering, it needn't adjust the threshold for the convenient on rendering and the outlines are more precise and exact. Besides, attaching the graftal and sketching shadow makes the composition of an image more attractive. Through a series of clever image processes, the system finally presents excellent colored pencil style drawings. Because the proposed algorithm is not complicated, the rendering time is quite short compared to other past related studies. Compared with other research works and Photoshop on a set of benchmarks, the system demonstrates its strength in the aspects of full automation, stability of sketching quality and higher visual satisfaction, all achieved in a considerably shorter time. [ABSTRACT FROM AUTHOR]

The storage capacity of the conventional neural network is 0.14 times of the number of neurons (P=0.14N). Due to the huge difficulty in recognizing large number of images or patterns,researchers are looking for new methods at all times. Quantum Neural Network (QNN), which is a young and outlying science built upon the combination of classical neural network and quantum computing,is a candidate to solve this problem.This paper presents Quantum Probability Distribution Network (QPDN) whose elements of the storage matrix are distributed in a probabilistic way on the base of quantum linear superposition and applies QPDN on image recognition. Contrasting to the conventional neural network, the storage capacity of the QPDN is increased by a factor of 2N,where N is the number of neurons. Besides,the case analysis and simulation tests have been carried out for the recognition of images in this paper, and the result indicates that QPDN can recognize the images or patterns effectively and its working process accords with quantum evolvement process. [ABSTRACT FROM AUTHOR]

This paper proposes a novel algorithm for nonnegative independent component analysis, which is based on minimizing the mutual information of the separated signals, and is truly insensitive to the particular underlying distribution of the source data. The unmixing system culminates to a novel neural network model. Compared with other algorithms for nonnegative ICA, the method proposed in this paper can work efficiently even in the case that the source signals are not well grounded, and that pre-whiting process is not needed. Finally, the experiments were performed on both simulating signals and mixtures of image data, the results indicate that the algorithm is efficient and effective. [ABSTRACT FROM AUTHOR]

In this paper we propose a formal approach to the generative design of artefacts. The founding idea, bridging the gap between the domain of architectural artefacts and the field of ontologies, is to represent the notion of species as it exists in the context of generative design by the concept of class existing in the field of formal ontologies. In this paper we propose an artefact design methodology and a system based on it that assists a designer in the building process of artefact 3D models. The implemented system is structured in three conceptual levels: the Design Strategy, the Computational Model, and the 3D graphical rendering system. The Computational model has been defined and developed using the Frame Logic formalism. The proposed methodology is independent of specific modelling environments. In this paper we also present methodological directions to couple artefact representations with 3D rendering systems. [ABSTRACT FROM AUTHOR]

This paper deals with the problem of global stability for a class of neural networks with time-varying delays. A new sufficient condition for global stability is proposed by using some slack matrix variables to express the relationship between the system matrices. The restriction on the derivative of the delay function to be less than unit is removed. A numerical example shows that the result obtained in this paper improves the upper bound of the delay over some existing ones. [ABSTRACT FROM AUTHOR]

This paper extends a survey on Networked Control Systems (NCSs) published in previous papers. General frameworks and some fundamental issues for the study of NCSs are proposed. A significant emphasis has been on developing control methodologies to study the character of NCSs. This survey paper presents recent NCSs control methodologies, some promising research directions are also covered. [ABSTRACT FROM AUTHOR]

Let consider n autonomous mobile robots that can move in a two dimensional plane. The gathering problem is one of the most fundamental tasks of autonomous mobile robots. In short, given a set of robots with arbitrary initial locations, gathering must make all robots meet in finite time at a point that is not predefined. In this paper, we study about the feasibility of gathering by mobile robots that have φ-absolute error dynamic compasses. While the direction of each local coordinate system is fixed in usual systems, the dynamic compass model allows the angle difference between a local coordinate system and the global coordinate system to vary with time in the range of [0, φ]. This paper proposes a semi-synchronous gathering algorithm for n robots with (π/2 − ε)-absolute error dynamic compasses, where ε is an arbitrary small constant larger than zero. To the best of our knowledge, the proposed algorithm is the first one that considers both inaccurate compass models and more than two robots. We also show the optimality of our algorithm. It is proved that for any φ ≥ π/2, there is no algorithm to gather two robots with φ-absolute error dynamic compasses. [ABSTRACT FROM AUTHOR]

We consider some problems about the computation time of evolutionary algorithms in this paper. First, some exact analytic expressions of the mean first hitting times of general evolutionary algorithms in finite search spaces are obtained theoretically by using the properties of Markov chain associated with evolutionary algorithms considered here. Then, by introducing drift analysis and applying Dynkin's Formula, the general upper and lower bounds of the mean first hitting times of evolutionary algorithms are estimated rigorously under some mild conditions listed in the paper. Those results in this paper are commonly useful. Also, the analytic techniques adopted in the paper are widely instructive for analyzing the computation time of evolutionary algorithms in a given search space as long as some specific mathematical arts are introduced accordingly. [ABSTRACT FROM AUTHOR]

This paper presents an approach for solving the driving load forecasting problem based on Cascade Neural Networks with node-decoupled extended Kalman Filtering (CNN-NDEKF). Because of the inherent advantages, hybrid electric vehicles (HEV) are being given more and more attention. The power control strategy of HEVs is the key technology which determines the HEV's efficiency and pollutive emission level. Since the extent of improvement involved with HEV power control strategies greatly depends on the future driving load forecasting, in this paper, we attempt to achieve driving load forecasting using CNN-NDEKF. Instead of forecasting the entire load sequence, we define 5 load levels by a fuzzy logic method and then we forecast the load level. Simulation study is given to illustrate the feasibility of the driving load forecasting approach. [ABSTRACT FROM AUTHOR]

Aiming at improving the convergence performance of conventional BP neural network, this paper presents an improved PSO algorithm instead of gradient descent method to optimize the weights and thresholds of BP network. The strategy of the algorithm is that in each iteration loop, on every dimension d of particle swarm containing n particles, choose the particle whose velocity decreases most quickly to mutate its velocity according to some probability. Simulation results show that the new algorithm is very effective. It is successful to apply the algorithm to gas turbine fault diagnosis. [ABSTRACT FROM AUTHOR]

In this paper, we study the Cohen-Grossberg neural networks with mixed time-varying delays. By applying the Lyapunov functional method and combining with the inequality 3abc ≤ a3 + b3 + c3 (a,b,c > 0) technique, a series of new and useful criteria on the existence of equilibrium point and its global asymptotical stability are established. The results obtained in this paper extend and generalize the corresponding results existing in previous literature. [ABSTRACT FROM AUTHOR]

This paper studies a general class of neural networks with time-varying delays and the neuron activations belong to the set of discontinuous monotone increasing functions. The discontinuities in the activations are an ideal model of the situation where the gain of the neuron amplifiers is very high. Because the delay in combination with high-gain nonlinearities is a particularly harmful source of potential instability, in the paper, conditions which ensure the global convergence of the neural network are derived. [ABSTRACT FROM AUTHOR]

Electromagnetic (EM)-based neural network (NN) approaches have recently gained recognition as unconventional and useful methods for radio frequency (RF) components modeling. In this paper, several improvement techniques including a new data preprocessing technique and an improved training algorithm are presented. Comprehensive cases are compared in this paper. The experimental results indicate that with these techniques, the modified model has better performance. [ABSTRACT FROM AUTHOR]

Process models play important role in computer aided pro- cess engineering. Although the structure of these models are a priori known, model parameters should be estimated based on experiments. The accuracy of the estimated parameters largely depends on the information content of the experimental data presented to the parameter identification algorithm. Optimal experiment design (OED) can maximize the confidence on the model parameters. The paper proposes a new additive sequential evolutionary experiment design approach to maximize the amount of information content of experiments. The main idea is to use the identified models to design new experiments to gradually improve the model accuracy while keeping the collected information from previous experiments. This scheme requires an effective optimization algorithm, hence the main contribution of the paper is the incorporation of Evolutionary Strategy (ES) into a new iterative scheme of optimal experiment design (AS-OED). This paper illustrates the applicability of AS-OED for the design of feeding profile for a fed-batch biochemical reactor. [ABSTRACT FROM AUTHOR]

Traditional indexing methods face the difficulty of"curse of dimensionality" at high dimensionality. In this paper, the traditional vector approximation is improved. Firstly, it decreases the dimensions by LLE (locally-linear-embedding). As a result of it, a set of absolute low dimensions are gotten. Then, this paper uses the Gaussian mixture distribution and estimates the distribution through EM (expectation-maximization) method. The original data vectors are replaced by vector approximation. This approach gains higher efficiency and less run time. The experiments show a remarkable reduction of I/O. They also show an improvement on the indexing performance and then speed the image retrieval. [ABSTRACT FROM AUTHOR]

This paper presents the integration of linguistic knowledge in learning semantic user profiles able to represent user interests in a more effective way with respect to classical keyword-based profilesThis research was partially funded by the EC under the 6th FP IST IP VIKEF No. 507173, Priority 2.3.1.7 Semantic Based Knowledge Systems (www.vikef.net) and under the DELOS NoE on Digital Libraries, Priority: Technology-enhanced Learning and Access to Cultural Heritage - Contract n. G038-507618 (www.delos.info). The work was supported also by the research project "Modelli avanzati di personalizzazione per biblioteche elettroniche", year 2005, funded by the University of Bari.. Semantic profiles are obtained by integrating a naïve Bayes approach for text categorization with a word sense disambiguation strategy based on the WordNet lexical database (Section 2). Semantic profiles are exploited by the "conference participant advisor" service in order to suggest papers to be read and talks to be attended by a conference participant. Experiments on a real dataset show the effectiveness of the service (Section 3). [ABSTRACT FROM AUTHOR]

The inherent nonlinear of switched reluctance motor (SRM) makes it hard to get a good performance by using the conventional PID controller to the speed control of SRM. This paper develops a radial basis function (RBF) artificial neural network (ANN) nonlinear prediction model based adaptive PID controller for SRM. ANN, under certain condition, can approximate any nonlinear function with arbitrary precision. It also has a strong ability of adaptive, self-learning and self-organization. So, combining it with the conventional PID controller, a neural network based adaptive PID controller can be developed. Appling it to the speed control of SRM, a good control performance can be gotten. At the same time, the nonlinear mapping property and high parallel operation ability of ANN make it suitable to be applied to establish nonlinear prediction model performing parameter prediction. In this paper, two ANN - NNC and NNI are employed. The former is a back propagation (BP) ANN with sigmoid activation function. The later is an ANN using RBF as activation function. The former is used to adaptively adjust the parameters of the PID controller on line. The later is used to establish nonlinear prediction model performing parameter prediction. Compared with BP ANN with sigmoid activation function, the RBF ANN has a more fast convergence speed and can avoid getting stuck in a local optimum. Through parameter prediction, response speed of the system can be improved. To increase the convergence speed of ANN, an adaptive learning algorithm is adopted in this paper that is to adjust the learning rate according to the error. This can increase the convergence speed of ANN and make the system response quick. The experimental results demonstrate that a high control performance is achieved. The system responds quickly with little overshoot. The steady state error is zero. The system shows robust performance to the load torque disturbance. [ABSTRACT FROM AUTHOR]

This paper addresses a capacitated production planning (CPP) problem with outsourcing. Specially, the outsourcing problem considered in this paper has the following features: (1) all demands are met by production, inventory, outsourcing, and sale loss without postponement or backlog; (2) The goal of the solution to this problem is to minimize the total cost covering the production, setup, inventory holding, sale loss, and outsourcing activities; (3) different from previous studies which usually involved some special assumptions on the cost function for these activities, the cost function structure we consider in this paper are arbitrary and time-varying; and (4) we consider a general problem situation where the production, inventory, and outsourcing have a capacity limitation. It is likely that there is no solution in the model due to the consideration of such general cost functions and many constraints, hence we employ a Bellman/Ford algorithm for checking feasible solutions of the problem and resulting in a feasible solution region. After that, a proposed algorithm is applied for searching a global optimal solution with in the feasible solution region. [ABSTRACT FROM AUTHOR]

The use of an ontology in order to provide a mechanism to enable machine reasoning has continuously increased during the last few years. This paper proposed an automated method for document classification using an ontology, which expresses terminology information and vocabulary contained in Web documents by way of a hierarchical structure. Ontology-based document classification involves determining document features that represent the Web documents most accurately, and classifying them into the most appropriate categories after analyzing their contents by using at least two pre-defined categories per given document features. In this paper, Web documents are classified in real time not with experimental data or a learning process, but by similarity calculations between the terminology information extracted from Web documents and ontology categories. This results in a more accurate document classification since the meanings and relationships unique to each document are determined. [ABSTRACT FROM AUTHOR]

The research work in this paper focuses on solving the critical problems in Web Service discovery such as how to locate functionality-desired Web Services and how to select the best one from large numbers of functionality-similar Web Services. The semantic description and quality description of Web Service based on ontology proposed in this paper, provides a consistent description of different kinds of Web Service, which is used as the basis of service matching. Then the matching model of Web Service is discussed in detail, which consists of semantic similarity matching according to functionality of Web Service, and semantic filtering according to quality of Web Service. Using the descriptions and matching approach, the performance of Web Service discovery can be improved by increasing the precision and recall of Web Service searching. [ABSTRACT FROM AUTHOR]

This paper illustrates an algorithm for osteosarcoma segmentation, using vectorial fuzzy-connectedness segmentation, and coming up with a methodology which can be used to segment some distinct tissues of osteosarcoma such as tumor, necrosis and parosteal sarcoma from 3D vectorial images. However, fuzzy-connectedness segmentation can be successfully used only in connected regions. In this paper, some improvements have been made to segment the interested tissues which are distributed in disconnected regions. And the paper speeds up the process of segmentation by segmenting two osteosarcoma tissues simultaneously. The methology has been applied to a medical image analysis system of osteosarcoma segmentation and 3D reconstruction, which has been put into practical use in some hospitals. [ABSTRACT FROM AUTHOR]

This paper suggests an automated method for document classification using an ontology, which expresses terminology information and vocabulary contained in Web documents by way of a hierarchical structure. Ontologybased document classification involves determining document features that represent the Web documents most accurately, and classifying them into the most appropriate categories after analyzing their contents by using at least two pre-defined categories per given document features. In this paper, Web documents are classified in real time not with experimental data or a learning process, but by similar calculations between the terminology information extracted from Web texts and ontology categories. This results in a more accurate document classification since the meanings and relationships unique to each document are determined. Keywords: Document classification, Ontology, Web Page classification. [ABSTRACT FROM AUTHOR]

Raster map should be corrected after scanned because of the errors caused by paper map deformation. In the paper, the deficiency of the polynomial fitting method is analyzed. The paper introduces an ANN (Artificial Neural Network) correcting method that utilizes the advantage of its function approximation ability. In the paper, two types of ANNs, BP and GRNN, are designed for the correcting. The comparing experiment is done with the same data by the polynomial fitting and ANN methods, utilizing the MALAB. The experiment results show that the ANN methods, especially the GRNN method, performances far better than the polynomial fitting method does. [ABSTRACT FROM AUTHOR]

This paper investigates the fault detection and prediction of rhythmically soniferous products, such as clocks, watches and timers. Such products with fault cannot work steadily or probably cause malfunction. The authors extend the concept of computer audition and establish an architectural model of product fault prediction system based on probabilistic neural networks. The system listens to the product sound by the multimedia technology and the sound features are extracted to detect and predict faults by the neural network. The paper analyzes the reasons of timer faults and the corresponding sound features. Experiments are made in the laboratory to demonstrate the proposed method. The technology is expected to apply in factories in coming years for realizing automatic product test and improving efficiency of product inspection. [ABSTRACT FROM AUTHOR]

This chapter contains papers presented in the workshop on Text Mining and Applications (TeMA 2005), organized in the framework of the Portuguese Association for Artificial Intelligence conference (EPIA). This workshop is aimed at attracting quality papers and enhancing the knowledge in this area. 27 papers were submitted. From these, 9 papers were selected for publication in this Springer volume. These numbers show current importance of this field in AI and suggest that the organization of equivalent events in future EPIA editions should be pursued. First paper works on bilingual lexical acquisition from non parallel corpora, applicable in Machine Translation. Second paper describes work on Text Summarization. Third uses Transformation Based learning for NP Identification applied to Portuguese.Fourth uses linguistic knowledge for passage retrieval and question answering. Fifth describes the use of weakly supervised learning for extraction of semantic patterns. Sixth paper proposes a method for semantic indexing and evaluates it on traditional Information Retrieval tasks. Seventh works on unsupervised language independent extraction of multi-word terms, applicable in multiple domains and evaluates their results for Slovene and English. Eighth paper presents a variant of a known method for Anaphora resolution, adapted to Portuguese. Last paper proposes a stemmer for Brazilian Portuguese. [ABSTRACT FROM AUTHOR]

Formal methods constitute a means of developing reliable and correctly behaving software based on a specification. In scenarios where information technology is used as a foundation to enable human communication, this is, however, not always enough. Successful interaction between humans often depends on the concept of trust, which is different from program correctness. In this paper, we present a framework for integrating trust into a formal development process, allowing for the construction of formally correct programs for communication, embracing trust as a central concept. We present a coordination language for use with action systems, taking a modular approach of separating trust aspects from other functionality. We also believe that our work can be adapted to modelling other aspects beside trust. Throughout the paper, we employ a case study as a testbed for our concepts. [ABSTRACT FROM AUTHOR]

By a domain we mean a universe of discourse. Typical examples are (partially) man-made universes of discourse - such as Air Traffic, Airports, Financial Services (banks, insurance companies, securities trading [brokers, traders, stock exchanges]), Health Care (hospitals etc.), Secure IT Systems (according to Intl. ISO/IEC Standard 17799), The Market (consumers, retailers, wholesalers, producers, "the supply chain"), Transportation (road, air, sea and/or rail transport), etc. We shall outline how one might describe such (infrastructure component) domains, informally and formally - what the current descriptional limitations appear to be, and, hence, the prospects for future research as well as practice. The current paper is based on Part IV, Chaps. 8-16 of [3]. The volume is one of [1,2,3]. The aim of this paper is to suggest a number of areas of domain theory and methodology research. [ABSTRACT FROM AUTHOR]

This paper surveys some classic and recent results on the finite axiomatizability of bisimilarity over CCS-like languages. It focuses, in particular, on non-finite axiomatizability results stemming from the semantic interplay between parallel composition and nondeterministic choice. The paper also highlights the role that auxiliary operators, such as Bergstra and Klop's left and communication merge and Hennessy's merge operator, play in the search for a finite, equational axiomatization of parallel composition both for classic process algebras and for their real-time extensions. [ABSTRACT FROM AUTHOR]

Mathematical and computational modelling are research areas with increasing importance in the study of behaviour in complex biological systems. With the increasing breadth and depth of models under consideration, a disciplined approach to managing the diverse data associated with these models is needed. Of particular importance is the issue of provenance, where a model result is linked to information about the generating model, the parameters used in that model and the papers and experiments that were used to derive those parameters. This paper presents an architecture to manage this information along with accompanying tool support and examples of the management system in use at various points in the development of a large model. [ABSTRACT FROM AUTHOR]

In this paper, selecting line segments as matching features in stereo vision, the orientation difference (O.D.) of the line segments is more deeply evaluated than the previous studies and two new constraints i.e. ordering and collinearity are proposed. The O.D. was supposed to be used for an indoor application, reducing candidates without elimination of the actual matches, especially if the line is horizontal or vertical with respect to the floor. The findings of this paper are as follows: 1) Applying a threshold on O.D. would result in a missing probability for the actual matches and this probability can be calculated for any given threshold, 2) The upper limit of O.D. for horizontal and vertical lines is a function of geometric parameters of the system, 3) An optimal tilt angle, whose results is the minimum upper limit for O.D., can be computed, 4) for disambiguation process, ordering and collinearity constraints are proposed. These are applied in a matching algorithm and their effectiveness is investigated on real stereo images. [ABSTRACT FROM AUTHOR]

In this paper, the line segment tracking is considered for an imaging system with translational motions (T.M.), rotational motions (R.M.) and arbitrary motions. Assuming a CCD camera with an arbitrary tilt angle installed on a mobile robot equipped with odometry system, to reduce the search space in the correspondence problem, two constraints are developed. These constraints are location and orientation differences (O.D.) for line segments in consecutive images. The findings of this paper include: 1)The development of the effect of camera tilt on the location constraint for T.M., 2)Illustrating that the upper bound of O.D. for both horizontal and vertical lines with respect to the floor, is a function of tilt in T.M., which can considerably be reduced and thus providing a tight constraint, 3)The development of the location constraint for R.M., 4) The development of the PDF and upper bound of O.D. for R.M., 5) The development of the location and O.D. constraint for arbitrary motions. Furthermore, the efficiency of these developed constraints in a line tracking algorithm was verified. [ABSTRACT FROM AUTHOR]