16801553
Mini-Max Initialization for Function Approximation
No abstract available.
39601946
An Evolutionary System and Its Application to Automatic Image Segmentation
In this paper, an algorithm built on the notion of evolutionary system is proposed. During the evolution of distributed tribes, the individuals making up the tribes cooperatively effect pixel communication from one agent to the other in order to improve the homogeneity of the ensemble of the image regions that they represent. The proposed Artificial Coevolving Tribes, containing evolution, mature, propagate, and die, is explored in the context of image. Meanwhile, the given image is recognized and segmented. Stability and scale control of the algorithm is maintained. Results obtained on natural scenes are presented with the evolutionary process.
45083530
Improving backpropagation learning under limited precision
Abstract Most of the work to date on learning in neural networks assumes the availability of unlimited precision for implementing weights and the neural transfer functions. Recently some studies have investigated the effects of limited precision on the learning and generalisation performance. In this paper, we identify the causes of performance degradation due to limited precision and propose a novel algorithm to improve the performance of Backpropagation.
8311095
Classifying image texture with statistical landscape features
This paper proposes to use three-dimensional information derived from the graph of an image function for texture description. The graph of an image function is a rumpled surface appearing like a landscape. To characterize the texture through this landscape, six novel texture feature curves based on the statistics of the geometrical and topological properties of the solids shaped by the graph and a variable horizontal plane are used. The proposed statistical landscape features have been shown by systematic experiments to offer very low error rates on a large subset of the Brodatz texture album having excluded some nonhomogeneous images, the entire Brodatz texture set, as well as the VisTex texture collection.
205904713
Fuzzy aggregated connectedness for image segmentation
Fuzzy methodology has been successfully applied to image analysis and pattern recognition since the theory of fuzzy set was 0rst introduced by Zadeh [1]. It is believed that the fuzzy set theory models the inherent imprecision in images. Fuzzy geometrical approaches focus on the spatial measures and have attracted considerable research interest in handling the spatial uncertainty in images [2]. Fuzzy connectedness is an important topological property of images. The classical de0nition was given by Rosenfeld [3]. A modi0cation to the traditional concept of fuzzy connectedness was further proposed [4]. Based on the notion of fuzzy connectedness of image elements, fuzzy objects for n-dimensional digital spaces was exploited for image segmentation [5]. Fuzzy connectedness is a natural extension to the crisp connectedness and re:ects the imprecise topological structures of images. The algorithms in the literature usually compute the fuzzy connectedness with regard to the best path between a pair of points. This approach su;ers from high sensitivity to noise. Noise in corrupted images may misguide the detection of the best path and further in:uence the determination of fuzzy connectedness. We believe that this has mainly been due to the binarization in determining the best path. The information of a path is either fully preserved or discarded and this contradicts the concept of fuzzy sets. In this paper,
32843088
Analysis of Zipf's law: An index approach
Abstract A rigorous analysis of Zipf's law is made using an index for the sequence of observed values of the variables in a Zipf-type relationship. Three important properties relating rank, count, and frequency are identified. Using this approach, the shape of Zipf-type curves can be described in terms of three distinct regions and two parameters of the Mandelbrot-Zipf law. This result has considerable practical significance, since it provides rigorous foundations for the application of Zipf's law.
369741
EXPedite: a system for encoded XML processing
As XML becomes an increasingly popular format for information exchange, the efficient processing of broadcast XML data on a constrained device (for example, a cell phone or a PDA) becomes a critical task. In this paper we present the EXPedite system: a new model of data processing in an information exchange environment, which "migrates" the power of the data-sending server to receivers for efficient processing. It consists of a simple and general encoding scheme for servers, and streaming query processing algorithms on encoded XML stream for data receivers with constrained computing abilities. Experiments show the impressive performance of EXPedite.
2875554
A note on domination and minus domination numbers in cubic graphs
Abstract Let G = ( V , E ) be a graph. A subset S of V is called a dominating set if each vertex of V − S has at least one neighbor in S . The domination number γ ( G ) equals the minimum cardinality of a dominating set in G . A minus dominating function on G is a function f : V → { − 1 , 0 , 1 } such that f ( N [ v ] ) = ∑ u ∈ N [ v ] f ( u ) ≥ 1 for each v ∈ V , where N [ v ] is the closed neighborhood of v . The minus domination number of G is γ − ( G ) = min { ∑ v ∈ V f ( v ) ∣ f  is a minus dominating function on  G } . It was incorrectly shown in [X. Yang, Q. Hou, X. Huang, H. Xuan, The difference between the domination number and minus domination number of a cubic graph, Applied Mathematics Letters 16 (2003) 1089–1093] that there is an infinite family of cubic graphs in which the difference γ − γ − can be made arbitrary large. This note corrects the mistakes in the proof and poses a new problem on the upper bound for γ − γ − in cubic graphs.
1752675
Storing and Discovering Critical Workflows from Log in Scientific Exploration
This paper aims at effectively reproducing the results of previous scientific workflow executions. We first identify the information that needs to be recorded in a workflow execution log, based on which we then determine the data flow among experiments. To effectively record a workflow execution log in a relational database management system (RDBMS) when the workflow design is absent, we propose a generic relational storage schema. Then techniques have been designed to automatically discover the minimal set of experiments that must be performed in order to reproduce a scientific result by posing appropriate SQL queries. Although such SQL queries can be evaluated using an off-the-shelf database system, we investigate the unique characteristics of the workflow log data and optimization techniques for evaluating such SQL queries efficiently.
18271710
Verification Framework for Dynamic Collaborative Services in Service-Oriented Architecture
This paper introduces a dynamic verification framework for collaborative services in service-oriented architecture (SOA). Collaboration plays a critical role in SOA, an effective verification framework for collaboration will greatly reduce the effort for rapid and adaptive service composition and evaluation of applications based on collaborative services. The verification framework provides a service-oriented infrastructure for completeness and consistency analyses, model-checking, simulation, and policy enforcement of process specification based on collaborative services in SOA. The paper presents the concepts, architecture, profiling techniques and illustrative examples that demonstrate the concepts and the techniques