Physical Sciences and Mathematics Commons^™

Rule-Mitigated Collaboration Technology, Carl Chang, Alexei Vorontsov, Jia Zhang, Francis Quek

Jia Zhang

No abstract provided.

Fuzzy Neural Network Models For Supervised Classification: Multispectral Image Analysis, Arun D. Kulkarni, Kamlesh Lulla

Arun Kulkarni

No abstract provided.

Computational Complexity For Continuous Time Dynamics, Hava Siegelmann, Asa Ben-Hur, Shmuel Fishman

Hava Siegelmann

Dissipative flows model a large variety of physical systems. In this Letter the evolution of such systems is interpreted as a process of computation; the attractor of the dynamics represents the output. A framework for an algorithmic analysis of dissipative flows is presented, enabling the comparison of the performance of discrete and continuous time analog computation models. A simple algorithm for finding the maximum of n numbers is analyzed, and shown to be highly efficient. The notion of tractable (polynomial) computation in the Turing model is conjectured to correspond to computation with tractable (analytically solvable) dynamical systems having polynomial complexity.

Probabilistic Crowding: Deterministic Crowding With Probabilistic Replacement, Ole J. Mengshoel, David E. Goldberg

Ole J Mengshoel

This paper presents a novel niching algorithm, probabilistic crowding. Like its predecessor deterministic crowding, probabilistic crowding is fast, simple, and requires no parameters beyond that of the classical GA. In probabilistic crowding, subpopulations are maintained reliably, and we analyze and predict how this maintenance takes place.

This paper also identifies probabilistic crowding as a member of a family of algorithms, which we call integrated tournament algorithms. Integrated tournament algorithms also include deterministic crowding, restricted tournament selection, elitist recombination, parallel recombinative simulated annealing, the Metropolis algorithm, and simulated annealing.

Discontinuities In Recurrent Neural Networks, R. Gavaldà, Hava Siegelmann

Hava Siegelmann

This article studies the computational power of various discontinuous real computational models that are based on the classical analog recurrent neural network (ARNN). This ARNN consists of finite number of neurons; each neuron computes a polynomial net function and a sigmoid-like continuous activation function. We introduce arithmetic networks as ARNN augmented with a few simple discontinuous (e.g., threshold or zero test) neurons. We argue that even with weights restricted to polynomial time computable reals, arithmetic networks are able to compute arbitrarily complex recursive functions. We identify many types of neural networks that are at least as powerful as arithmetic nets, …

Graded Functional Activation In The Visuo-Spatial System With The Amount Of Task Demand, Patricia Carpenter, Marcel Just, Timothy Keller, William Eddy, Keith Thulborn

Marcel Adam Just

No abstract provided.

Optimization Methods For Logical Inference, Vijay Chandru, John Hooker

John Hooker

No abstract provided.

Time Course Of Fmri-Activation In Language And Spatial Networks During Sentence Comprehension, Patricia A. Carpenter, Marcel Adam Just, Timothy A. Keller, William F. Eddy, Keith R. Thulborn

Marcel Adam Just

No abstract provided.

Plasticity Of Language-Related Brain Function During Recovery From Strok, Keith R. Thulborn, Patricia A. Carpenter, Marcel Adam Just

Marcel Adam Just

No abstract provided.

Computational Modeling Of High-Level Cognition And Brain Function, Marcel Adam Just, Patricia A. Carpenter, Sashank Varma

Marcel Adam Just

No abstract provided.

Indexing Flower Patent Images Using Domain Knowledge, Madirakshi Das, R. Manmatha, Edward M. Riseman

R. Manmatha

A new approach to indexing a specialized database by utilizing the color and spatial domain knowledge available for the database is described. This approach is illustrated by using it to provide a solution to the problem of indexing images of flowers for searching a flower patents database by color. The flower region is isolated from the background by using an automatic iterative segmentation algorithm with domain knowledge-driven feedback. The color of the flower is defined by the color names present in the flower region and their relative proportions. The database can be queried by example and by color names. The …

Multi-Modal Retrieval Of Trademark Images Using Global Similarity, S Ravela, R. Manmatha

R. Manmatha

In this paper a system for multi-modal retrieval of trademark images is presented. Images are characterized and retrieved using associated text and visual appearance. A user initiates retrieval for similar trademarks by typing a text query. Subsequent searches can be performed by visual appearance or using both appearance and text information. Textual information associated with trademarks is searched using the INQUERY search engine. Images are searched visually using a method for global image similarity by appearance developed in this paper. Images are filtered with Gaussian derivatives and geometric features are computed from the filtered images. The geometric features used here …